arXiv Machine Learning By Wenxin Chen, Weishen Pan, Kyra Gan, Fei Wang

MOSIC: Model-Agnostic Optimal Subgroup Identification with Multi-Constraint for Improved Reliability

Read the original on arXiv Machine Learning →

arXiv:2504. 20908v3 Announce Type: replace Abstract: Current subgroup identification methods typically follow a two-step approach: first estimate conditional average treatment effects and then apply thresholding or rule-based procedures to define subgroups.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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