mlsanityData to 7 Oct 2026

Optimal Transport Reweighting for Robust Learning under Spurious Correlations and Label Noise

arXiv 2610.01028 ↗First posted 1 Oct 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Machine learning models often suffer performance degradation under subpopulation shift, particularly when spurious correlations cause models to rely on shortcut features that fail to generalize across subgroups. A recent line of work mitigates this issue by using loss-based signals to identify informative samples, but these signals can become severely distorted under label noise: mislabeled samples may also incur large losses and contaminate subsequent reweighting or retraining. Despite its practical importance, this intersection remains largely underexplored. We propose POTER, a reweighting framework based on optimal transport that derives sample importance from the transport geometry between the training distribution and a reference distribution constructed from limited validation group annotations. By measuring alignment at the individual-sample level rather than relying on loss, POTER downweights mislabeled or strongly bias-aligned samples while assigning higher importance to samples better aligned with the reference distribution. In addition, POTER requires only a single ERM training stage, moving beyond the retraining paradigm common in recent work. Across standard benchmarks and noisy-label settings, POTER achieves state-of-the-art worst-group accuracy, including cases where label corruption is concentrated within minority subgroups.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 32 of its 42 references that are in the map. First posted on arXiv 1 Oct 2026.

Builds on

32 of 42 references.

References · 32

  1. 2014Deep Learning Face Attributes in the Wildcited by 3,679
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  3. 2019Invariant Risk Minimizationcited by 1,832
  4. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
  5. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
  6. 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
  7. 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 522
  8. 2019Nuanced Metrics for Measuring Unintended Bias with Real Data for Text Classificationcited by 396
  9. 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 379
  10. 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 363
  11. 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
  12. 2022Correct-N-Contrast: A Contrastive Approach for Improving Robustness to Spurious Correlationscited by 171
20 more
  1. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 169
  2. 2022Spread Spurious Attribute: Improving Worst-group Accuracy with Spurious Attribute Estimationcited by 88
  3. 2023LAVA: Data Valuation without Pre-Specified Learning Algorithmscited by 69
  4. 2023Simple and Fast Group Robustness by Automatic Feature Reweightingcited by 68
  5. 2022MaskTune: Mitigating Spurious Correlations by Forcing to Explorecited by 66
  6. 2023Towards Last-layer Retraining for Group Robustness with Fewer Annotationscited by 54
  7. 2023Robust Learning with Progressive Data Expansion Against Spurious Correlationcited by 39
  8. 2018Distributionally Robust Mean-Variance Portfolio Selection with Wasserstein Distancescited by 24
  9. 2023Data Valuation and Detections in Federated Learningcited by 17
  10. 2023Wasserstein distributional robustness of neural networkscited by 15
  11. 2024Improving Group Robustness on Spurious Correlation Requires Preciser Group Inferencecited by 15
  12. 2023Distributionally Robust Optimization with Probabilistic Groupcited by 14
  13. 2022AGRO: Adversarial Discovery of Error-prone groups for Robust Optimizationcited by 10
  14. 2024Understanding Domain Generalization: A Noise Robustness Perspectivecited by 8
  15. 2025Severing Spurious Correlations with Data Pruningcited by 7
  16. 2025Mitigating Spurious Correlation via Distributionally Robust Learning with Hierarchical Ambiguity Setscited by 7
  17. 2024Robustness to Subpopulation Shift with Domain Label Noise via Regularized Annotation of Domainscited by 6
  18. 2024Improving Robustness to Multiple Spurious Correlations by Multi-Objective Optimizationcited by 6
  19. 2022Improving group robustness under noisy labels using predictive uncertaintycited by 4
  20. 2026Distributionally Robust Classification for Multi-source Unsupervised Domain Adaptationcited by 3

Built on by

Not cited yet.