Entropic smoothing and gradient approximation for Wasserstein distributionally robust optimization
math.OC, stat.ML
Submitted: 2025-06-05
Updated: 2026-11-13
Terminology
Sources
- Theoretical smoothing frameworks for nonsmooth simple bilevel problems
- Distributionally Robust Optimization and Robust Statistics
- Annealed Sinkhorn for Optimal Transport: convergence, regularization path and debiasing
- Decreasing Entropic Regularization Averaged Gradient for Semi-Discrete Optimal Transport
- DRO: A Python Library for Distributionally Robust Optimization in Machine Learning
- A stochastic smoothing framework for nonconvex-nonconcave minEmax problems with applications to Wasserstein distributionally robust optimization
- The gradient's limit of a definable family of functions admits a variational stratification
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise