arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.04035cs.GT
收藏

低失真聚类与序数和有限基数信息

Low-Distortion Clustering with Ordinal and Limited Cardinal Information

Jakob Burkhardt, Ioannis Caragiannis, Karl Fehrs, Matteo Russo, Chris Schwiegelshohn, Sudarshan Shyam

AI总结:

针对聚类中的度量失真问题,提出利用资源增强和有限基数信息,分别实现指数簇数下的低失真及多项式查询下的常数失真。

摘要:

受计算社会选择领域近期工作的启发,我们将度量失真框架扩展到聚类问题。给定位于底层度量空间中的一组 $n$ 个智能体,我们的目标是将它们划分为 $k$ 个簇,并优化某个社会成本目标。度量空间由智能体位置之间的距离函数 $d$ 定义。关于 $d$ 的信息仅通过 $n$ 个排名隐式可得,每个智能体根据与其他智能体的距离对其余所有智能体进行排名。尽管如此,我们仍希望根据使用 $d$ 定义的社会成本目标来评估聚类算法。这通过失真概念实现,失真衡量聚类与最优解的差距,并考虑与可用序数信息一致的所有底层度量。不幸的是,最重要的聚类目标不允许具有有限失真的算法。为规避这一令人失望的事实,我们采用两种替代方法:首先,我们探索资源增强是否有益。我们考虑使用多于 $k$ 个簇的算法,但将其社会成本与最优 $k$ 聚类进行比较。我们表明,使用(就 $k$ 而言)指数多个簇,对于 $k$-中心 和 $k$-中位数 目标可以获得低(常数或对数)失真。有趣的是,这种指数爆炸被证明是必要的。更重要的是,我们探索有限基数信息能否用于获得更好的结果。有点令人惊讶的是,对于 $k$-中位数 和 $k$-中心,我们表明,查询次数在 $k$ 上为多项式且在 $n$ 上仅为对数(即,对于实践中大多数相关场景,仅相对于智能体数量为次线性)就足以获得常数失真。

英文摘要:

Motivated by recent work in computational social choice, we extend the metric distortion framework to clustering problems. Given a set of $n$ agents located in an underlying metric space, our goal is to partition them into $k$ clusters, optimizing some social cost objective. The metric space is defined by a distance function $d$ between the agent locations. Information about $d$ is available only implicitly via $n$ rankings, through which each agent ranks all other agents in terms of their distance from her. Still, we would like to evaluate clustering algorithms in terms of social cost objectives that are defined using $d$. This is done using the notion of distortion, which measures how far from optimality a clustering can be, taking into account all underlying metrics that are consistent with the ordinal information available. Unfortunately, the most important clustering objectives do not admit algorithms with finite distortion. To sidestep this disappointing fact, we follow two alternative approaches: We first explore whether resource augmentation can be beneficial. We consider algorithms that use more than $k$ clusters but compare their social cost to that of the optimal $k$-clusterings. We show that using exponentially (in terms of $k$) many clusters, we can get low (constant or logarithmic) distortion for the $k$-center and $k$-median objectives. Interestingly, such an exponential blowup is shown to be necessary. More importantly, we explore whether limited cardinal information can be used to obtain better results. Somewhat surprisingly, for $k$-median and $k$-center, we show that a number of queries that is polynomial in $k$ and only logarithmic in $n$ (i.e., only sublinear in the number of agents for the most relevant scenarios in practice) is enough to get constant distortion.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑