mlsanityData to 14 Oct 2026

Ranking & Reweighting Improves Group Distributional Robustness

arXiv 2305.05759 ↗First posted 9 May 2023cs.LG cs.AI cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Recent work has shown that standard training via empirical risk minimization (ERM) can produce models that achieve high accuracy on average but low accuracy on underrepresented groups due to the prevalence of spurious features. A predominant approach to tackle this group robustness problem minimizes the worst group error (akin to a minimax strategy) on the training data, hoping it will generalize well on the testing data. However, this is often suboptimal, especially when the out-of-distribution (OOD) test data contains previously unseen groups. Inspired by ideas from the information retrieval and learning-to-rank literature, this paper first proposes to use Discounted Cumulative Gain (DCG) as a metric of model quality for facilitating better hyperparameter tuning and model selection. Being a ranking-based metric, DCG weights multiple poorly-performing groups (instead of considering just the group with the worst performance). As a natural next step, we build on our results to propose a ranking-based training method called Discounted Rank Upweighting (DRU), which differentially reweights a ranked list of poorly-performing groups in the training data to learn models that exhibit strong OOD performance on the test data. Results on several synthetic and real-world datasets highlight the superior generalization ability of our group-ranking-based (akin to soft-minimax) approach in selecting and learning models that are robust to group distributional shifts.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 25 references that are in the map. First posted on arXiv 9 May 2023.

Builds on

15 of 25 references.

References · 15

  1. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  2. 2014Deep Learning Face Attributes in the Wildcited by 3,693
  3. 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
  4. 2016Equality of Opportunity in Supervised Learningcited by 2,007
  5. 2019Invariant Risk Minimizationcited by 1,854
  6. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
  7. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
  8. 2016Inherent Trade-Offs in the Fair Determination of Risk Scorescited by 586
  9. 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 523
  10. 2015Empirical Evaluation of Rectified Activations in Convolutional Networkcited by 519
  11. 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 364
  12. 2016Demographic Dialectal Variation in Social Media: A Case Study of African-American Englishcited by 196
3 more
  1. 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 183
  2. 2021Types of Out-of-Distribution Texts and How to Detect Themcited by 80
  3. 2016Does Distributionally Robust Supervised Learning Give Robust Classifiers?cited by 38

Built on by

Not cited yet.