mlsanityData to 13 Oct 2026

Geometry-Calibrated DRO: Combating Over-Pessimism with Free Energy Implications

arXiv 2311.05054 ↗First posted 8 Nov 2023cs.LG cs.AIcited by 5

Not on the map. Why?

Abstract (arXiv)

Machine learning algorithms minimizing average risk are susceptible to distributional shifts. Distributionally Robust Optimization (DRO) addresses this issue by optimizing the worst-case risk within an uncertainty set. However, DRO suffers from over-pessimism, leading to low-confidence predictions, poor parameter estimations as well as poor generalization. In this work, we conduct a theoretical analysis of a probable root cause of over-pessimism: excessive focus on noisy samples. To alleviate the impact of noise, we incorporate data geometry into calibration terms in DRO, resulting in our novel Geometry-Calibrated DRO (GCDRO) for regression. We establish the connection between our risk objective and the Helmholtz free energy in statistical physics, and this free-energy-based risk can extend to standard DRO methods. Leveraging gradient flow in Wasserstein space, we develop an approximate minimax optimization algorithm with a bounded error ratio and elucidate how our approach mitigates noisy sample effects. Comprehensive experiments confirm GCDRO's superiority over conventional DRO methods.

Key facts. Cited by 5 papers in the map (data through 13 Oct 2026). Builds on 17 of its 39 references that are in the map. First posted on arXiv 8 Nov 2023.

Builds on

17 of 39 references.

References · 17

  1. 2020In Search of Lost Domain Generalizationcited by 1,048
  2. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 336
  3. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
  4. 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 312
  5. 2019Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networkscited by 242
  6. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  7. 2016Variance-based regularization with convex objectivescited by 153
  8. 2019Distributionally Robust Optimization and Generalization in Kernel Methodscited by 73
  9. 2018Efficient Algorithms for Outlier-Robust Regressioncited by 72
  10. 2020Distributionally Robust Losses for Latent Covariate Mixturescited by 58
  11. 2021DORO: Distributional and Outlier Robust Optimizationcited by 56
  12. 2022Minimax Regret Optimization for Robust Machine Learning under Distribution Shiftcited by 31
5 more
  1. 2022Streaming Algorithms for High-Dimensional Robust Statisticscited by 21
  2. 2019Incorporating Unlabeled Data into Distributionally Robust Learningcited by 20
  3. 2022Holistic Robust Data-Driven Decisionscited by 18
  4. 2017Data-driven Optimal Cost Selection for Distributionally Robust Optimizationcited by 15
  5. 2021Distributionally Robust Learning with Stable Adversarial Trainingcited by 14

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2024: 1; 2025: 3; 2026: 1.

5 papers.