arXiv:2510. 07750v3 Announce Type: replace-cross Abstract: Robust optimization safeguards decisions against uncertainty by optimizing against worst-case scenarios, yet their effectiveness hinges on a prespecified robustness level that is often chosen ad hoc, leading to either insufficient protection or overly conservative and costly solutions.
By Wenbin Zhou, Shixiang Zhu
arXiv:2605.08506v3 Announce Type: replace
Abstract: Robust optimization (RO) provides a principled framework for decision-making under uncertainty, but its performance critically depends on the choic...
By Shuyi Chen, Wenbin Zhou, Shixiang Zhu
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:2307.02719v5 Announce Type: replace
Abstract: Uncertainty sampling is a classical active-learning strategy, yet the statistical objective induced by its query rule is often implicit. We introdu...
By Shang Liu, Xiaocheng Li
arXiv:2404. 03578v3 Announce Type: replace Abstract: The sim-to-real gap, which represents the disparity between training and testing environments, poses a significant challenge in reinforcement learning (RL).
By Miao Lu, Han Zhong, Tong Zhang, Jose Blanchet
arXiv:2606. 00002v1 Announce Type: new Abstract: Mixed-Integer Linear Programming (MILP) decision engines routinely output nominally optimal plans for high-stakes industrial systems.
By Yi-Xiang Hu