Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Polynomial-Time Approximation for Pairwise Fair $k$-Median Clustering (2405.10378v2)

Published 16 May 2024 in cs.DS, cs.AI, and cs.LG

Abstract: In this work, we study pairwise fair clustering with $\ell \ge 2$ groups, where for every cluster $C$ and every group $i \in [\ell]$, the number of points in $C$ from group $i$ must be at most $t$ times the number of points in $C$ from any other group $j \in [\ell]$, for a given integer $t$. To the best of our knowledge, only bi-criteria approximation and exponential-time algorithms follow for this problem from the prior work on fair clustering problems when $\ell > 2$. In our work, focusing on the $\ell > 2$ case, we design the first polynomial-time $O(k2\cdot \ell \cdot t)$-approximation for this problem with $k$-median cost that does not violate the fairness constraints. We complement our algorithmic result by providing hardness of approximation results, which show that our problem even when $\ell=2$ is almost as hard as the popular uniform capacitated $k$-median, for which no polynomial-time algorithm with an approximation factor of $o(\log k)$ is known.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (43)
  1. Constant approximation for individual preference stable clustering. In Advances in Neural Information Processing Systems (NeurIPS), 2023.
  2. Fair clustering via equitable group representations. In Proceedings of the Conference on Fairness, Accountability, and Transparency (FAccT), page 504–514, 2021.
  3. Constant-factor FPT approximation for capacitated k𝑘kitalic_k-median. In Annual European Symposium on Algorithms (ESA), volume 144 of LIPIcs, pages 1:1–1:14, 2019.
  4. Individual preference stability for clustering. In International Conference on Machine Learning (ICML), 2022.
  5. Clustering without over-representation. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pages 267–275, 2019.
  6. Centrality of trees for capacitated k-center. Math. Program., 154(1-2):29–53, 2015.
  7. A technique for obtaining true approximations for k𝑘kitalic_k-center with covering constraints. In International conference on integer programming and combinatorial optimization, pages 52–65. Springer, 2020.
  8. Scalable fair clustering. In International Conference on Machine Learning, pages 405–413, 2019.
  9. On coresets for fair clustering in metric and euclidean spaces and their applications. In 48th International Colloquium on Automata, Languages, and Programming (ICALP), volume 198 of LIPIcs, pages 23:1–23:15, 2021.
  10. A constant approximation for colorful k𝑘kitalic_k-center. In 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019.
  11. Fair algorithms for clustering. In Advances in Neural Information Processing Systems, pages 4954–4965, 2019.
  12. On the cost of essentially fair clusterings. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2019.
  13. Fair clustering with multiple colors. arXiv preprint arXiv:2002.07892, 2020.
  14. Fairness, semi-supervised learning, and more: A general framework for clustering with stochastic pairwise constraints. In Proc. Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI), 2021.
  15. A pairwise fair and community-preserving approach to k𝑘kitalic_k-center clustering. In International Conference on Machine Learning (ICML), pages 1178–1189, 2020.
  16. Matroid and knapsack center problems. Algorithmica, 75(1):27–52, 2016.
  17. Proportionally fair clustering. In International Conference on Machine Learning, pages 1032–1041, 2019.
  18. Fair clustering through fairlets. In Advances in Neural Information Processing Systems, pages 5029–5037, 2017.
  19. How to solve fair k𝑘kitalic_k-center in massive data models. In Proceedings of the International Conference on Machine Learning (ICML), pages 1877–1886, 2020.
  20. Approximating fair clustering with cascaded norm objectives. In Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2664–2683, 2022.
  21. Fair representation clustering with several protected classes. In Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency, pages 814–823, 2022.
  22. The hardness of 3333-uniform hypergraph coloring. Combinatorica, 25(5):519–535, 2005.
  23. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 448–455, 2003.
  24. Socially fair k𝑘kitalic_k-means clustering. In Madeleine Clare Elish, William Isaac, and Richard S. Zemel, editors, Conference on Fairness, Accountability, and Transparency (FAccT), pages 438–448, 2021.
  25. Constant-factor approximation algorithms for socially fair k𝑘kitalic_k-clustering. arXiv preprint arXiv:2206.11210, 2022.
  26. Which lpsubscript𝑙𝑝l_{p}italic_l start_POSTSUBSCRIPT italic_p end_POSTSUBSCRIPT norm is the fairest? approximations for fair facility location across all “p𝑝pitalic_p”, 2022.
  27. Approximation algorithms for fair range clustering. In International Conference on Machine Learning, pages 13270–13284. PMLR, 2023.
  28. Fair colorful k𝑘kitalic_k-center clustering. In International Conference on Integer Programming and Combinatorial Optimization, pages 209–222. Springer, 2020.
  29. Fair k𝑘kitalic_k-centers via maximum matching. In Proceedings of the International Conference on Machine Learning (ICML), pages 4940–4949, 2020.
  30. A center in your neighborhood: Fairness in facility location. In Proceedings of the Symposium on Foundations of Responsible Computing (FORC), page 5:1–5:15, 2020.
  31. The capacitated K-center problem. SIAM J. Discrete Math., 13(3):403–418, 2000.
  32. Fair k𝑘kitalic_k-center clustering for data summarization. In 36th International Conference on Machine Learning, ICML 2019, pages 5984–6003. International Machine Learning Society (IMLS), 2019.
  33. The matroid median problem. In Proceedings of the Symposium on Discrete Algorithms (SODA), pages 1117–1130, 2011.
  34. Constant approximation for k-median and k-means with outliers via iterative rounding. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pages 646–659, 2018.
  35. Shi Li. On uniform capacitated k𝑘kitalic_k-median beyond the natural lp relaxation. ACM Transactions on Algorithms (TALG), 13(2):1–18, 2017.
  36. Individual fairness for k𝑘kitalic_k-clustering. In Proceedings of the International Conference on Machine Learning (ICML), pages 6586–6596, 2020.
  37. Approximation algorithms for socially fair clustering. In Conference on Learning Theory (COLT), pages 3246–3264. PMLR, 2021.
  38. Proportionally fair clustering revisited. In International Colloquium on Automata, Languages, and Programming (ICALP), 2020.
  39. Scalable algorithms for individual preference stable clustering. In International Conference on Artificial Intelligence and Statistics, pages 1108–1116, 2024.
  40. Better algorithms for individually fair k𝑘kitalic_k-clustering. Advances in Neural Information Processing Systems (NeurIPS), 34:13340–13351, 2021.
  41. Privacy preserving clustering with constraints. In International Colloquium on Automata, Languages, and Programming (ICALP), 2018.
  42. Fair coresets and streaming algorithms for fair k𝑘kitalic_k-means. In International Workshop on Approximation and Online Algorithms, pages 232–251, 2019.
  43. Improved approximation algorithms for individually fair clustering. In International Conference on Artificial Intelligence and Statistics (AISTATS), pages 8758–8779. PMLR, 2022.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now