arXiv:2610. 42109v1 Announce Type: cross Abstract: Distributionally robust optimization (DRO) minimizes worst-case risk under distributional uncertainty, but its decisions can be suboptimal in terms of their excess risk, or regret.
By Sloan Nietert, Daniel Kuhn
The paper introduces a distributionally robust method for learning hyperparameters of first‑order convex optimization algorithms. By minimizing a Wasserstein‑robust performance estimation problem over a dataset of problem instances, the approach interpolates between classical learning‑to‑optimize (L2O) and worst‑case PEP design. The authors solve the resulting problem with stochastic gradient descent, provide high‑probability risk bounds, and demonstrate that the learned algorithms outperform both worst‑case optimal and vanilla L2O baselines on logistic regression, LASSO, and linear programming tasks.
By Vinit Ranjan, Jisun Park, Bartolomeo Stellato
arXiv:2506.04948v4 Announce Type: replace-cross
Abstract: Wasserstein distributionally robust optimization offers a framework for model fitting in machine learning under potential shifts in the data...
By Tam Le (LPSM)
arXiv:2504. 10796v4 Announce Type: replace-cross Abstract: Distributionally robust optimization (DRO) is widely used for decision-making under uncertainty, but its adversarial focus on worst-case loss can lead to overly conservative policies.
By Lukas-Benedikt Fiechtner, Jose Blanchet
arXiv:2608. 13133v1 Announce Type: cross Abstract: Distributional shifts arise when the target deployment environment differs from the source environment that generated the training data.
By Zhiyi Li, Xiaojie Mao, Yunbei Xu, Ruohan Zhan
arXiv:2606. 30230v1 Announce Type: cross Abstract: Learned reconstruction operators for inverse problems are typically trained under a fixed noise model, and generalize poorly when the distribution during testing differs from the one assumed during training.
By Floor van Maarschalkerwaart, Subhadip Mukherjee, Christoph Brune, Marcello Carioni
The paper investigates Wasserstein distributionally robust optimization (WDRO) for classification, showing that ordering hypotheses by WDRO risk aligns with robust accuracy only for a specific class of loss functions. It demonstrates that common losses like cross‑entropy can misalign robust accuracy and WDRO risk, and introduces Wasserstein distributional attacks (WDA) with a support‑search algorithm to directly evaluate robust accuracy. Experiments on CIFAR‑10, CIFAR‑100, and ImageNet reveal that WDA achieves the lowest adversarial accuracy in most settings.
By Bach C. Le, Tung V. Dao, Binh T. Nguyen, Hong T. M. Chu
arXiv:2604. 18546v2 Announce Type: replace Abstract: We propose a distributionally robust approach to risk-sensitive estimation of an unknown signal x from an observed signal y.
By Feras Al Taha, Eilyan Bitar
arXiv:2412. 20556v2 Announce Type: replace-cross Abstract: We study distributionally robust optimization (DRO) for robust inference when the worst-case distribution is continuous, leading to significant computational challenges due to the infinite-dimensional nature of the optimization problem.
By Linglingzhi Zhu, Yunqin Zhu, Yao Xie
arXiv:2607. 27995v1 Announce Type: cross Abstract: Adversarial training has emerged as a powerful approach for protecting models against adversarial attacks in a broad range of real-world applications.
By Yiling Xie, Xiaoming Huo
arXiv:2509. 09371v2 Announce Type: replace-cross Abstract: Distributionally robust optimization (DRO) protects statistical learning against distributional shifts by optimizing the worst-case performance over a set of perturbed distributions.
By Zitao Wang, Nian Si, Molei Liu
arXiv:2608. 13418v1 Announce Type: cross Abstract: Given a dataset where a portion of the samples are contaminated, our goal is to recover the underlying clean population distribution.
By Yikai Xu, Zhao Chen, Jian Huang