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