- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper extends proportionally fair clustering from finite datasets to probability distributions, investigating the existence and generalization properties of proportionally fair clusterings. The authors establish connections between finite-sample and distributional fairness, deriving both upper and lower bounds on the sample complexity required to transfer fairness guarantees. They further construct a distribution for which exact proportional fairness fails at infinitely many cluster budgets, while proving eventual existence for several broad distribution families, including absolutely continuous distributions in dimensions up to five. Additional results establish exact-core existence for specific distributions and cluster budgets. Overall, the paper provides a systematic theoretical investigation of proportional fairness in distributional clustering.
Critical strengths
- The paper investigates an interesting extension of proportional fairness from finite datasets to underlying probability distributions. This perspective is relevant to machine learning, where clustering algorithms are typically developed using finite samples but are expected to generalize to unseen data.
- The paper provides a rich set of theoretical results, including sample complexity upper and lower bounds, nonexistence constructions, and existence guarantees for several distribution families. These results offer valuable insights into the fundamental properties of proportionally fair clustering and establish meaningful connections between statistical learning and geometric analysis.
Critical weaknesses
- Although the paper establishes exact-core existence for several distribution families, some results are primarily existential and do not provide explicit bounds on the required number of centers or efficient algorithms for obtaining them. This limits their immediate applicability to practical clustering problems.
- everal theoretical guarantees, particularly those concerning four- and five-dimensional distributions and specific disk configurations, depend on computer-assisted proofs. While this approach is reasonable, the reproducibility and accessibility of the corresponding verification procedures are important for establishing confidence in these results.
Questions for authors
- Theorem 6 establishes exact-core existence for sufficiently large cluster budgets under certain distributional assumptions. Could the authors further discuss whether explicit bounds on the required number of centers can be obtained for some common distribution families, or whether the existence arguments could lead to efficient constructive algorithms?
- Some important results in Appendix E.3 and F.2 rely on exact computational verification. Could the authors clarify how these results can be independently reproduced, including the availability of verification code, computational certificates, and the corresponding execution procedures?
- The paper focuses on proportional fairness, whereas a substantial body of fair clustering research considers group fairness defined by sensitive attributes. Although this distinction is briefly discussed in Appendix I, a more explicit conceptual comparison in the main text would help readers better understand the differences, relationships, and potential complementarity between these fairness notions. The authors may consider discussing additional representative studies on sensitive-attribute-based fair clustering, such as [1–3], to better contextualize the contribution of this work.
[1] Zhou, P., Li, R., & Du, L. (2024). Fair Kernel K-Means: from Single Kernel to Multiple Kernel. Advances in Neural Information Processing Systems (NeurIPS), 37, 99686–99714.
[2] Kjærsgaard, R. D., Parviainen, P., Saurabh, S., Kundu, M., & Clemmensen, L. (2024). Fair Soft Clustering. Proceedings of the 27th International Conference on Artificial Intelligence and Statistics (AISTATS), Proceedings of Machine Learning Research, 238, 1270–1278.
[3] Park, J., Kim, K., Lee, J., & Kim, Y. (2026). Fair Model-based Clustering. Proceedings of the AAAI Conference on Artificial Intelligence, 40(29), 24773–24781.
Notification for reminding the discussion deadline.
Dear authors and reviewers,
Since there is about one day left in the discussion period, I would appreciate it if you could respond to the review and revise your manuscript.
If the authors respond to the review, I would also appreciate it if the reviewers could reply as soon as possible.
Thank you.