arXiv:2502. 17602v2 Announce Type: replace-cross Abstract: We study a class of stochastic nonsmooth optimization problems in which an outer variable minimizes the expectation of a pointwise maximum.
By Wei Liu, Muhammad Khan, Gabriel Mancino-Ball, Yangyang Xu
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: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:2609. 39449v1 Announce Type: new Abstract: Distributionally robust optimization (DRO) studies parameter estimation under uncertainty in the underlying probability distribution and has emerged as a principled framework for analyzing robustness and generalization.
By Elis Stefansson, David V\"avinggren, Ant\^onio H. Ribeiro
arXiv:2606. 27767v1 Announce Type: new Abstract: Optimizing functionals over the space of probability measures is now ubiquitous in machine learning.
By Cl\'ement Bonet, Pierre-Cyril Aubin-Frankowski, Youssef Mroueh
arXiv:2608. 06283v1 Announce Type: new Abstract: We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex.
By Iosif Lytras, Nikolaos Makras, Sotirios Sabanis
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 develops a diffusion approximation for stochastic gradient descent (SGD) when the optimization target is a functional on the Wasserstein space ℝ2. By lifting the problem to a Hilbert space via Lions differentiability, the authors construct a Gaussian random-field approximation whose velocity field matches the mean and covariance of the original stochastic gradient. They prove that this Gaussian approximation achieves second‑order weak accuracy, providing a rigorous basis for replacing sample‑driven randomness with analytically tractable Gaussian fluctuations in stochastic optimization over probability measures.
By Maria Oprea, Qin Li, Yunan Yang
The paper presents a convergence analysis of the Wasserstein proximal algorithm without requiring geodesic convexity of the objective functional. By assuming a Wasserstein analog of the Euclidean Polyak–Łojasiewicz inequality, the authors prove that the algorithm achieves unbiased, linear convergence, improving on previous rates that required strong geodesic convexity. The analysis is extended to inexact proximal steps for geodesically semiconvex objectives, and numerical experiments show faster convergence than noisy gradient descent on mean‑field neural networks.
By Shuailong Zhu, Xiaohui Chen
We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex. We introduce the Subgradient Tamed Unadjusted Langevin Algorithm (SG-TULA), a discretisation of the Langevin diffusion that operates directly on subgradients, without relying on computationally demanding smoothing procedures.
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
The paper introduces MS‑WDRO, a multi‑source Wasserstein distributionally robust optimization framework for reconstructing complex network topologies from scarce target‑domain data and abundant heterogeneous source data. It fuses sources via a weighted Wasserstein barycenter, builds an ambiguity set around it, and solves a regularized Laplacian estimator using a provably convergent ADMM scheme. The authors provide finite‑sample guarantees, demonstrate that naive aggregation is suboptimal, and show through experiments on synthetic data and the ABIDE I neuroimaging dataset that MS‑WDRO outperforms seven baselines in graph recovery, sample efficiency, and diagnostic utility, especially when target samples are limited.
By Chuansen Peng, Yifan Xia, Jinshan Zhong, Xiaojing Shen