Robust Fair Clustering with Group Membership Uncertainty Sets
<|reference_start|>Robust Fair Clustering with Group Membership Uncertainty Sets: We study the canonical fair clustering problem where each cluster is constrained to have close to population-level representation of each group. Despite significant attention, the salient issue of having incomplete knowledge about the group membership of each point has been superficially addressed. In this paper, we consider a setting where errors exist in the assigned group memberships. We introduce a simple and interpretable family of error models that require a small number of parameters to be given by the decision maker. We then present an algorithm for fair clustering with provable robustness guarantees. Our framework enables the decision maker to trade off between the robustness and the clustering quality. Unlike previous work, our algorithms are backed by worst-case theoretical guarantees. Finally, we empirically verify the performance of our algorithm on real world datasets and show its superior performance over existing baselines.<|reference_end|>
@article{duppala2024robust,
    title={Robust Fair Clustering with Group Membership Uncertainty Sets},
    author={Sharmila Duppala, Juan Luque, John P. Dickerson, Seyed A. Esmaeili},
    journal={arXiv preprint arXiv:2406.00599},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.00599},
    primaryClass={cs.LG cs.AI cs.CY cs.DS}
}