New 'Check, Please' algorithm verifies fair clustering efficiently
Fair clustering verification was coNP-complete—until researchers found a scalable fix.
Get AI news that actually matters
One email a day. Zero fluff. Join 10,000+ professionals.
Researchers Yu He, Jeremy Vollen, and Edith Elkind present "Check, Please: Verifiably Fair Clustering." They show that verifying metric Proportional Justified Representation (mPJR) is coNP-complete. They introduce mPJR+, a metric analog of PJR+, which satisfies both (a) finding proportional outcomes and (b) checking proportionality, but auditing mPJR+ relies on repeated submodular minimization, making it impractical at scale. To address this, they propose an mPJR+ verification algorithm exponential in k but quasilinear in the number of datapoints. Motivated by these hardness results, they introduce DC-mPJR+, a proportionality concept that offers representation guarantees to a restricted set of coalitions around unselected centers, with an O(mn log n + mnk) verification algorithm. DC-mPJR+ outcomes can be computed efficiently, and any γ-DC-mPJR+ solution satisfies (γ+2)-mPJR+.
- mPJR verification is proven coNP-complete, meaning no efficient general algorithm exists.
- DC-mPJR+ verification runs in O(mn log n + mnk) time, exponential only in clusters k but quasilinear in data size.
- Any γ-DC-mPJR+ outcome guarantees (γ+2)-mPJR+, enabling practical fairness audits at scale.
Why It Matters
Enables efficient, verifiable fairness guarantees for clustering—critical for equitable AI in data-driven decisions.