$\u211d^d$中公平最大-最小多样化的更快算法
Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
AI总结:
针对公平最大-最小多样化(FairDiv)问题,提出首个近似线性时间、线性空间的常数近似算法,结合乘法权重更新与几何数据结构求解线性规划,还构建核集提出不依赖数据分布的高效流式算法,百万级数据集上一分钟内可达最优多样性。
摘要:
从数据集中提取多样化子集的任务(通常被称为最大多样化)在众多具有深远影响的实际应用中发挥着关键作用。在本研究中,我们深入探究公平感知数据子集选择领域,重点研究从包含$n$个数据点的大规模集合中选出大小为$k$的多样化集合的问题(FairDiv,即公平多样化)。\nFairDiv问题在数据管理与理论学界已得到充分研究。本文提出了首个可在近似线性时间内运行、仅占用线性空间的FairDiv常数近似算法。相比之下,所有已知的现有常数近似算法的运行时间均为超线性(关于$n$或$k$),且占用超线性空间。我们的方法通过创新性地结合乘法权重更新(Multiplicative Weight Update)方法与先进的几何数据结构,隐式且近似地求解一个线性规划,从而实现了这样的效率。此外,我们通过构建核集(coreset)进一步提升了技术的效率。借助该核集,我们还提出了首个适用于FairDiv问题的高效流式算法,其效率不依赖于数据点的分布。在百万规模数据集上的实证评估表明,我们的算法可在一分钟内达到最优的多样性表现,而所有现有技术要么效率极低,要么无法生成优质解。
英文摘要:
The task of extracting a diverse subset from a dataset, often referred to as maximum diversification, plays a pivotal role in various real-world applications that have far-reaching consequences. In this work, we delve into the realm of fairness-aware data subset selection, specifically focusing on the problem of selecting a diverse set of size $k$ from a large collection of $n$ data points (FairDiv). The FairDiv problem is well-studied in the data management and theory community. In this work, we develop the first constant approximation algorithm for FairDiv that runs in near-linear time using only linear space. In contrast, all previously known constant approximation algorithms run in super-linear time (with respect to $n$ or $k$) and use super-linear space. Our approach achieves this efficiency by employing a novel combination of the Multiplicative Weight Update method and advanced geometric data structures to implicitly and approximately solve a linear program. Furthermore, we improve the efficiency of our techniques by constructing a coreset. Using our coreset, we also propose the first efficient streaming algorithm for the FairDiv problem whose efficiency does not depend on the distribution of data points. Empirical evaluation on million-sized datasets demonstrates that our algorithm achieves the best diversity within a minute. All prior techniques are either highly inefficient or do not generate a good solution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。