Pith. sign in

REVIEW 3 cited by

Wasserstein Distributionally Robust Optimization and Variation Regularization

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

arxiv 1712.06050 v3 pith:GLJG5EVW submitted 2017-12-17 cs.LG math.OCstat.ML

classification cs.LGmath.OCstat.ML
keywords regularizationwassersteinlearningrobustvariationdistributionallyeffectlosses
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Wasserstein distributionally robust optimization (DRO) has recently achieved empirical success for various applications in operations research and machine learning, owing partly to its regularization effect. Although connection between Wasserstein DRO and regularization has been established in several settings, existing results often require restrictive assumptions, such as smoothness or convexity, that are not satisfied for many problems. In this paper, we develop a general theory on the variation regularization effect of the Wasserstein DRO - a new form of regularization that generalizes total-variation regularization, Lipschitz regularization and gradient regularization. Our results cover possibly non-convex and non-smooth losses and losses on non-Euclidean spaces. Examples include multi-item newsvendor, portfolio selection, linear prediction, neural networks, manifold learning, and intensity estimation for Poisson processes, etc. As an application of our theory of variation regularization, we derive new generalization guarantees for adversarial robust learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Tractable Reformulations of Distributionally Robust Two-stage Stochastic Programs with $\infty-$Wasserstein Distance

    math.OC 2019-08 conditional novelty 6.0 of 10

    Under sign conditions on the technology matrix, the worst-case expected recourse cost in two-stage distributionally robust programs with infinity-Wasserstein ambiguity is exactly a finite linear or conic program with ...

  2. Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning

    stat.ML 2019-08 accept novelty 3.0 of 10

    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...

  3. Distributionally Robust Optimization: A Review

    math.OC 2019-08 unverdicted

    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.

Pith tools