REVIEW 2 cited by
Data-driven Optimal Cost Selection for Distributionally Robust Optimization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
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.
Forward citations
Cited by 2 Pith papers
-
Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning
Wasserstein distributionally robust optimization yields data-driven decisions that are computable as convex programs and have finite-sample out-of-sample guarantees, and this tutorial unifies the theory with machine l...
-
Distributionally Robust Optimization: A Review
A broad review of distributionally robust optimization that organizes the literature by ambiguity-set type and connects DRO to robust optimization, risk aversion, chance constraints, and regularization.
Discussion (0). Continue with ORCID to comment.