Pith. sign in

REVIEW 1 cited by

Sensitivity analysis of Wasserstein distributionally robust optimization problems

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 2006.12022 v2 pith:JRPNCECA submitted 2020-06-22 math.OC math.PRmath.STq-fin.MFstat.TH

classification math.OCmath.PRmath.STq-fin.MFstat.TH
keywords modeloptimizationsensitivityuncertaintyconsiderdeduceexplicitfinance
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We consider sensitivity of a generic stochastic optimization problem to model uncertainty. We take a non-parametric approach and capture model uncertainty using Wasserstein balls around the postulated model. We provide explicit formulae for the first order correction to both the value function and the optimizer and further extend our results to optimization under linear constraints. We present applications to statistics, machine learning, mathematical finance and uncertainty quantification. In particular, we provide explicit first-order approximation for square-root LASSO regression coefficients and deduce coefficient shrinkage compared to the ordinary least squares regression. We consider robustness of call option pricing and deduce a new Black-Scholes sensitivity, a non-parametric version of the so-called Vega. We also compute sensitivities of optimized certainty equivalents in finance and propose measures to quantify robustness of neural networks to adversarial examples.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. DRO-Augment Framework: Robustness by Synergizing Wasserstein Distributionally Robust Optimization and Data Augmentation

    stat.ML 2025-06 conditional novelty 4.0 of 10

    Adding a Wasserstein DRO gradient penalty to Mixup, AugMix, or NoisyMix raises average CIFAR-C accuracy by about 1.1% and PGD robustness on MNIST and Fashion-MNIST by 5-7%.

Pith tools