Minimax Regret Learning for Data with Heterogeneous Subgroups
Weibin Mo, Weijing Tang, Songkai Xue, Yufeng Liu, Ji Zhu

TL;DR
This paper introduces a minimax regret learning framework for data with heterogeneous subgroups, aiming to improve robustness and generalization to unseen populations, especially under noise heterogeneity.
Contribution
It develops a distribution-free robust hierarchical model using minimax regret, with theoretical guarantees and specialization to linear and generalized linear models.
Findings
Empirical MMR guarantees regret bounds on training and unseen populations.
Specialized MMR framework reveals geometric properties distinct from other robust methods.
Demonstrated effectiveness through simulations and image recognition applications.
Abstract
Modern complex datasets often consist of various sub-populations with known group information. In the presence of sub-population heterogeneity, it is crucial to develop robust and generalizable learning methods that (1) can enjoy robust performance on each of the training populations, and (2) is generalizable to an unseen testing population. While various min-max formulations have been proposed to achieve (1) in the robust learning literature, their generalization to an unseen testing is less explored. Moreover, a general min-max formulation can be sensitive to the noise heterogeneity, and, in the extreme case, be degenerate such that a single high-noise population dominates. The min-max-regret (MMR) can mitigate these challenges. In this work, we consider a distribution-free robust hierarchical model for the generalization from multiple training populations to an unseen testing…
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.
Taxonomy
TopicsFace and Expression Recognition
