mlsanityData to 7 Oct 2026

Data-driven Optimal Cost Selection for Distributionally Robust Optimization

arXiv 1705.07152 ↗First posted 19 May 2017stat.MLcited by 15

Not on the map. Why?

Abstract (arXiv)

Recently, (Blanchet, Kang, and Murhy 2016, and Blanchet, and Kang 2017) showed that several machine learning algorithms, such as square-root Lasso, Support Vector Machines, and regularized logistic regression, among many others, can be represented exactly as distributionally robust optimization (DRO) problems. The distributional uncertainty is defined as a neighborhood centered at the empirical distribution. We propose a methodology which learns such neighborhood in a natural data-driven way. We show rigorously that our framework encompasses adaptive regularization as a particular case. Moreover, we demonstrate empirically that our proposed methodology is able to improve upon a wide range of popular machine learning estimators.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 May 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 6; 2022: 2; 2023: 2; 2024: 1; 2025: 4.

15 papers.

Sort:

By area: