Approximating Fair Clustering with Cascaded Norm Objectives

We introduce the (p, q)-Fair Clustering problem. In this problem, we are given a set of points P and a collection of different weight functions W . We would like to find a clustering which minimizes the lq-norm of the vector over W of the lp-norms of the weighted distances of points in P from the centers. This generalizes various clustering problems, including Socially Fair k-Median and k-Means, and is closely connected to other problems such as Densest k-Subgraph and Min k-Union. We utilize convex programming techniques to approximate the (p, q)-Fair Clustering problem for different values of p and q. When p ≥ q, we get an O(k), which nearly matches a k lower bound based on conjectured hardness of Min k-Union and other problems. When q ≥ p, we get an approximation which is independent of the size of the input for bounded p, q, and also matches the recent O((log n/(log logn)))-approximation for (p,∞)-Fair Clustering by Makarychev and Vakilian (COLT 2021).

[1]  Pranjal Awasthi,et al.  A Notion of Individual Fairness for Clustering , 2020, ArXiv.

[2]  Sudipto Guha,et al.  A constant-factor approximation algorithm for the k-median problem (extended abstract) , 1999, STOC '99.

[3]  Barbara M. Anthony,et al.  A Plant Location Guide for the Unsure : Approximation Algorithms for Min-Max Location Problems , 2009 .

[4]  Robert D. Carr,et al.  Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.

[5]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[6]  Michael Dinitz,et al.  The Densest k-Subhypergraph Problem , 2016, APPROX-RANDOM.

[7]  Pranjal Awasthi,et al.  Fair k-Center Clustering for Data Summarization , 2019, ICML.

[8]  Ola Svensson,et al.  Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms , 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[9]  Kurt Mehlhorn,et al.  New Approximability Results for the Robust k-Median Problem , 2013, SWAT.

[10]  Shi Li,et al.  On Uniform Capacitated k-Median Beyond the Natural LP Relaxation , 2014, SODA.

[11]  Krzysztof Onak,et al.  Scalable Fair Clustering , 2019, ICML.

[12]  Christian Sohler,et al.  Fair Coresets and Streaming Algorithms for Fair k-Means Clustering , 2018, ArXiv.

[13]  David M. Mount,et al.  A local search approximation algorithm for k-means clustering , 2002, SCG '02.

[14]  Anupam Gupta,et al.  Simpler Analyses of Local Search Algorithms for Facility Location , 2008, ArXiv.

[15]  Mohit Singh,et al.  LP-Based Algorithms for Capacitated Facility Location , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[16]  Samir Khuller,et al.  On the cost of essentially fair clusterings , 2018, APPROX-RANDOM.

[17]  Nisheeth K. Vishnoi,et al.  Coresets for Clustering with Fairness Constraints , 2019, NeurIPS.

[18]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..

[19]  Sara Ahmadian,et al.  Clustering without Over-Representation , 2019, KDD.

[20]  Silvio Lattanzi,et al.  Fair Clustering Through Fairlets , 2018, NIPS.

[21]  Samir Khuller,et al.  A Pairwise Fair and Community-preserving Approach to k-Center Clustering , 2020, ICML.

[22]  Kamesh Munagala,et al.  Proportionally Fair Clustering , 2019, ICML.

[23]  Aditya Bhaskara,et al.  Fair Clustering via Equitable Group Representations , 2021, FAccT.

[24]  Santosh Vempala,et al.  Socially Fair k-Means Clustering , 2020, FAccT.

[25]  Ragesh Jaiswal,et al.  FPT Approximation for Socially Fair Clustering , 2021, ArXiv.

[26]  Yury Makarychev,et al.  Approximation Algorithms for Socially Fair Clustering , 2021, COLT.

[27]  Shi Li,et al.  Approximating k-median via pseudo-approximation , 2012, STOC '13.

[28]  Chaitanya Swamy,et al.  Approximation algorithms for minimum norm and ordered optimization problems , 2018, STOC.

[29]  R. Latala.  Estimation of moments of sums of independent real random variables , 1997 .

[30]  Deeparnab Chakrabarty,et al.  Generalized Center Problems with Outliers , 2018, ICALP.

[31]  Christopher Jung,et al.  A Center in Your Neighborhood: Fairness in Facility Location , 2019, ArXiv.

[32]  Deeparnab Chakrabarty,et al.  Fair Algorithms for Clustering , 2019, NeurIPS.

[33]  Michael Dinitz,et al.  Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion , 2016, SODA.

[34]  Pasin Manurangsi,et al.  Sherali-Adams Integrality Gaps Matching the Log-Density Threshold , 2018, APPROX-RANDOM.

[35]  Aditya Bhaskara,et al.  Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph , 2011, SODA.