Efficient Data-Driven Optimization with Noisy Data
Not on the map. Why?
Abstract (arXiv)
Classical Kullback-Leibler or entropic distances are known to enjoy certain desirable statistical properties in the context of decision-making with noiseless data. However, in most practical situations the data available to a decision maker is subject to a certain amount of measurement noise. We hence study here data-driven prescription problems in which the data is corrupted by a known noise source. We derive efficient data-driven formulations in this noisy regime and indicate that they enjoy an entropic optimal transport interpretation. Finally, we show that these efficient robust formulations are tractable in several interesting settings by exploiting a classical representation result by Strassen.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 55 references that are in the map. First posted on arXiv 8 Feb 2021.
Builds on
11 of 55 references.
References · 11
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2018Computational Optimal Transportcited by 780
- 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
- 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 183
- 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 170
- 2013Data-Driven Robust Optimizationcited by 85
- 2017Regularization via Mass Transportationcited by 81
- 2019Sinkhorn Divergences for Unbalanced Optimal Transportcited by 55
- 2017From Data to Decisions: Distributionally Robust Optimization is Optimalcited by 38
- 2016Recovering Best Statistical Guarantees via the Empirical Divergence-based Distributionally Robust Optimizationcited by 33
- 2019Tractable Reformulations of Distributionally Robust Two-stage Stochastic Programs with ∞-Wasserstein Distancecited by 3
Built on by
Citing papers per year: 2024: 1.
1 paper.