mlsanityData to 7 Oct 2026

Robust Optimization using Machine Learning for Uncertainty Sets

arXiv 1407.1097 ↗First posted 4 Jul 2014math.OC cs.LG stat.MLcited by 14

Not on the map. Why?

Abstract (arXiv)

Our goal is to build robust optimization problems for making decisions based on complex data from the past. In robust optimization (RO) generally, the goal is to create a policy for decision-making that is robust to our uncertainty about the future. In particular, we want our policy to best handle the the worst possible situation that could arise, out of an uncertainty set of possible situations. Classically, the uncertainty set is simply chosen by the user, or it might be estimated in overly simplistic ways with strong assumptions; whereas in this work, we learn the uncertainty set from data collected in the past. The past data are drawn randomly from an (unknown) possibly complicated high-dimensional distribution. We propose a new uncertainty set design and show how tools from statistical learning theory can be employed to provide probabilistic guarantees on the robustness of the policy.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Jul 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 7; 2024: 1; 2025: 1; 2026: 2.

14 papers.

Sort: