arXiv Machine Learning

Generalizing Fair Top-$k$ Selection: An Integrative Approach

arXiv:2603. 04689v3 Announce Type: replace-cross Abstract: Fair top-$k$ selection, which ensures appropriate proportional representation of members from minority or historically disadvantaged groups among the top-$k$ selected candidates, has drawn significant attention.

arXiv Machine Learning
Sep 21

Robust Mixture Models for Algorithmic Fairness Under Latent Heterogeneity

The paper introduces ROME, a framework that learns latent group structure while optimizing worst-group predictive performance. ROME links latent-variable modeling with distributionally robust optimization through an Expectation-Maximization approach for linear models and a neural Mixture-of-Experts for nonlinear settings. Experiments on simulations and three real-world regression datasets show that ROME improves worst-group performance while maintaining competitive overall accuracy compared to existing group-aware and group-label-free robust learning methods.

By Siqi Li, Molei Liu, Yiwei Lyu, Ziye Tian, Chuan Hong, Nan Liu
arXiv Machine Learning
Jun 2

Beyond Procedure: Substantive Fairness in Conformal Prediction

arXiv:2602. 16794v2 Announce Type: replace-cross Abstract: Conformal prediction (CP) offers distribution-free uncertainty quantification for machine learning models, yet its interplay with fairness in downstream decision-making remains underexplored.

By Pengqi Liu, Zijun Yu, Mouloud Belbahri, Arthur Charpentier, Masoud Asgharian, Jesse C. Cresswell