Alternatives to the Laplacian for Scalable Spectral Clustering with Group Fairness Constraints
Iv\'an Ojeda-Ruiz, Young Ju Lee, Malcolm Dickens, Leonardo Cambisaca

TL;DR
This paper introduces Fair-SMW, a new spectral clustering algorithm that improves computational efficiency and balance fairness using alternative matrix formulations, evaluated on real-world datasets.
Contribution
It proposes a novel reformulation of spectral clustering with fairness constraints using the Lagrangian and SMW identity, leading to faster and more balanced clustering solutions.
Findings
Fair-SMW is twice as fast as existing algorithms.
It achieves twice the fairness balance in clustering.
The method performs well on real-world network datasets.
Abstract
Recent research has focused on mitigating algorithmic bias in clustering by incorporating fairness constraints into algorithmic design. Notions such as disparate impact, community cohesion, and cost per population have been implemented to enforce equitable outcomes. Among these, group fairness (balance) ensures that each protected group is proportionally represented within every cluster. However, incorporating balance as a metric of fairness into spectral clustering algorithms has led to computational times that can be improved. This study aims to enhance the efficiency of spectral clustering algorithms by reformulating the constrained optimization problem using a new formulation derived from the Lagrangian method and the Sherman-Morrison-Woodbury (SMW) identity, resulting in the Fair-SMW algorithm. Fair-SMW employs three alternatives to the Laplacian matrix with different spectral gaps…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
