多样性最大化旨在从大型数据集中选择一个多样且具有代表性的物品子集。它是一项基础性优化任务,应用于数据摘要、特征选择、网络搜索、推荐系统等领域。然而,在数据物品根据性别或种族等敏感属性被关联到不同群体的情形下,如果不加以约束,该任务的算法解决方案可能会使某些群体代表不足或代表过度。因此,我们受此启发,研究带公平性约束的最大-最小多样化问题,目标是选择 k 个物品,使任意一对被选物品之间的最小距离最大化,同时确保从每个群体中选择的物品数量处于预定义的下界和上界之内。在本文中,我们提出了一种适用于小型数据集的、基于整数线性规划的精确算法,以及一种适用于任意 ε∈(0,1)、可扩展到大型数据集的 (1−ε)/5-近似算法。在真实世界数据集上进行的大量实验表明,我们提出的算法相比现有算法具有优越性能。
英文摘要:
Diversity maximization aims to select a diverse and representative subset of items from a large dataset. It is a fundamental optimization task that finds applications in data summarization, feature selection, web search, recommender systems, and elsewhere. However, in a setting where data items are associated with different groups according to sensitive attributes like sex or race, it is possible that algorithmic solutions for this task, if left unchecked, will under- or over-represent some of the groups. Therefore, we are motivated to address the problem of \emph{max-min diversification with fairness constraints}, aiming to select $k$ items to maximize the minimum distance between any pair of selected items while ensuring that the number of items selected from each group falls within predefined lower and upper bounds. In this work, we propose an exact algorithm based on integer linear programming that is suitable for small datasets as well as a $\frac{1-\varepsilon}{5}$-approximation algorithm for any $\varepsilon \in (0, 1)$ that scales to large datasets. Extensive experiments on real-world datasets demonstrate the superior performance of our proposed algorithms over existing ones.
Bridging Jensen Gap for Max-Min Group Fairness Optimization in Recommendation
Gaoling School of Artificial Intelligence, Renmin University of China(中国人民大学高瓴人工智能学院);School of Information Science and Technology, University of Science and Technology of China(中国科学技术大学信息科学技术学院);Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);NExT++ Research Center, National University of Singapore(新加坡国立大学NExT++研究中心)