Pith. sign in

REVIEW 10 cited by

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

arxiv 2411.02549 v3 pith:75A4FULT submitted 2024-11-04 math.OC cs.LGstat.ML

classification math.OCcs.LGstat.ML
keywords ambiguitydistributiondistributionallyfindingsoptimizationprobabilityresearchrobust
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Distributionally robust optimization (DRO) studies decision problems under uncertainty where the probability distribution governing the uncertain problem parameters is itself uncertain. A key component of any DRO model is its ambiguity set, that is, a family of probability distributions consistent with any available structural or statistical information. DRO seeks decisions that perform best under the worst distribution in the ambiguity set. This worst case criterion is supported by findings in psychology and neuroscience, which indicate that many decision-makers have a low tolerance for distributional ambiguity. DRO is rooted in statistics, operations research and control theory, and recent research has uncovered its deep connections to regularization techniques and adversarial training in machine learning. This survey presents the key findings of the field in a unified and self-contained manner.

Discussion (0). Sign in to comment.

Forward citations

Cited by 10 Pith papers

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

  1. Generative Distributionally Robust Optimization

    cs.LG 2026-07 conditional novelty 6.0 of 10

    GDRO pairs arbitrary conditional samplers with Sinkhorn-constrained generator-family adversaries to cut rare-context inventory regret ~60% and SocialGAN collisions ~50% versus nominal decisions.

  2. Relative Entropy-Bounded Ambiguous Chance Constraints for Robust Planning in Nonlinear Systems

    math.OC 2026-07 conditional novelty 6.0 of 10

    A relative-entropy ambiguity set with a Donsker–Varadhan bound, plus a quadratic-truncation-based estimate of its radius, yields a distributionally robust risk upper bound for nonlinear covariance steering.

  3. Robust Bayesian Portfolio Optimization with Discrepancy-based Posterior Ambiguity

    math.OC 2026-06 unverdicted novelty 6.0 of 10

    Introduces feedback-type ambiguity sets for robust Bayesian drift uncertainty in continuous-time portfolio optimization, yielding a modified HJBI equation and classical solution existence for exponential utility via v...

  4. Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    SGD is reformulated via a master equation from discrete updates, producing a discrete Fokker-Planck equation that predicts non-stationary variance growth proportional to learning rate in flat Hessian directions.

  5. Distributionally Robust Control via Stein Variational Inference for Contact-Rich Manipulation

    cs.RO 2026-05 conditional novelty 6.0 of 10

    SV-DRO evolves parameter particles via task-optimality-gap Stein gradients inside DRO-MPC, yielding up to 3× higher success on contact-rich manipulation under parametric uncertainty.

  6. Distributionally Robust Control via Stein Variational Inference for Contact-Rich Manipulation

    cs.RO 2026-05 unverdicted novelty 6.0 of 10

    Introduces a Stein variational inference-based deterministic formulation for distributionally robust control in contact-rich robotic manipulation, reporting up to 3x improved robustness under parametric uncertainty.

  7. Attribution-Guided Masking for Robust Cross-Domain Sentiment Classification

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    AGM adds a gradient-based masking loss during fine-tuning to suppress reliance on spurious tokens, achieving competitive zero-shot transfer on sentiment tasks while providing token-level interpretability.

  8. Robustness Measures in Distributionally Robust Optimization

    math.OC 2025-07 unverdicted novelty 6.0 of 10

    DRO regularizers are worst-case sensitivities of expected cost, supplying a robustness measure that guides uncertainty-set selection and traces performance-robustness frontiers.

  9. Wasserstein Robust Performative Prediction via Lagrangian Relaxation

    math.OC 2026-02 reject novelty 5.0 of 10

    A Wasserstein robust performative prediction framework with decision-dependent ambiguity claims linear convergence for two retraining algorithms, but the central convergence proof is not supported by the stated assumptions.

  10. Improved Stochastic Optimization of LogSumExp

    math.OC 2025-09 conditional novelty 5.0 of 10

    A rescaled SoftPlus family approximates LogSumExp with O(ρ) error, enabling stable stochastic optimization in entropic OT and KL-DRO.

Pith tools