mlsanityData to 7 Oct 2026

Towards Group Robustness in the presence of Partial Group Labels

arXiv 2201.03668 ↗First posted 10 Jan 2022cs.LG cs.AI cs.CVcited by 6

Not on the map. Why?

Abstract (arXiv)

Learning invariant representations is an important requirement when training machine learning models that are driven by spurious correlations in the datasets. These spurious correlations, between input samples and the target labels, wrongly direct the neural network predictions resulting in poor performance on certain groups, especially the minority groups. Robust training against these spurious correlations requires the knowledge of group membership for every sample. Such a requirement is impractical in situations where the data labeling efforts for minority or rare groups are significantly laborious or where the individuals comprising the dataset choose to conceal sensitive information. On the other hand, the presence of such data collection efforts results in datasets that contain partially labeled group information. Recent works have tackled the fully unsupervised scenario where no labels for groups are available. Thus, we aim to fill the missing gap in the literature by tackling a more realistic setting that can leverage partially available sensitive or group information during training. First, we construct a constraint set and derive a high probability bound for the group assignment to belong to the set. Second, we propose an algorithm that optimizes for the worst-off group assignments from the constraint set. Through experiments on image and tabular datasets, we show improvements in the minority group's performance while preserving overall aggregate accuracy across groups.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 28 of its 50 references that are in the map. First posted on arXiv 10 Jan 2022.

Builds on

28 of 50 references.

References · 28

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  3. 2019Invariant Risk Minimizationcited by 1,832
  4. 2020In Search of Lost Domain Generalizationcited by 1,042
  5. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
  6. 2018A Reductions Approach to Fair Classificationcited by 585
  7. 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 522
  8. 2019Agnostic Federated Learningcited by 451
  9. 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 363
  10. 2020An Investigation of Why Overparameterization Exacerbates Spurious Correlationscited by 310
  11. 2020Environment Inference for Invariant Learningcited by 306
  12. 2020Fairness without Demographics through Adversarially Reweighted Learningcited by 251
16 more
  1. 2018Empirical Risk Minimization under Fairness Constraintscited by 226
  2. 2020Domain Generalization using Causal Matchingcited by 224
  3. 2019Hidden Stratification Causes Clinically Meaningful Failures in Machine Learning for Medical Imagingcited by 215
  4. 2020No Subclass Left Behind: Fine-Grained Robustness in Coarse-Grained Classification Problemscited by 208
  5. 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 182
  6. 2020Large-Scale Methods for Distributionally Robust Optimizationcited by 179
  7. 2019Distributionally Robust Language Modelingcited by 142
  8. 2017Controllable Invariance through Adversarial Feature Learningcited by 127
  9. 2019Why Can't I Dance in the Mall? Learning to Mitigate Scene Bias in Action Recognitioncited by 117
  10. 2018Invariant Representations without Adversarial Trainingcited by 111
  11. 2020Robust Optimization for Fairness with Noisy Protected Groupscited by 78
  12. 2020Coping with Label Shift via Distributionally Robust Optimisationcited by 69
  13. 2020Null-sampling for Interpretable and Fair Representationscited by 16
  14. 2020Matrix Completion with Quantified Uncertainty through Low Rank Gaussian Copulacited by 10
  15. 2021Hodgelets: Localized Spectral Representations of Flows on Simplicial Complexescited by 10
  16. 2017Server, server in the cloud. Who is the fairest in the crowd?cited by 2

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 2.

6 papers.