Pith. sign in

REVIEW 2 cited by

Distributional Uncertainty Propagation via Optimal Transport

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 2205.00343 v2 pith:AIP3L7YD submitted 2022-04-30 math.OC

classification math.OC
keywords uncertaintyambiguitynoiseresultsestimationmanymodelmodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper addresses the limitations of standard uncertainty models, e.g., robust (norm-bounded) and stochastic (one fixed distribution, e.g., Gaussian), and proposes to model uncertainty via Optimal Transport (OT) ambiguity sets. These constitute a very rich uncertainty model, which enjoys many desirable geometrical, statistical, and computational properties, and which: (1) naturally generalizes both robust and stochastic models, and (2) captures many additional real-world uncertainty phenomena (e.g., black swan events). Our contributions show that OT ambiguity sets are also analytically tractable: they propagate easily and intuitively through linear and nonlinear (possibly corrupted by noise) transformations, and the result of the propagation is again an OT ambiguity set or can be tightly upper bounded by an OT ambiguity set. In the context of dynamical systems, our results allow us to consider multiple sources of uncertainty (e.g., initial condition, additive noise, multiplicative noise) and to capture in closed-form, via an OT ambiguity set, the resulting uncertainty in the state at any future time. Our results are actionable, interpretable, and readily employable in a great variety of computationally tractable control and estimation formulations. To highlight this, we study three applications in trajectory planning, consensus algorithms, and least squares estimation. We conclude the paper with a list of exciting open problems enabled by our results.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Efficient Uncertainty Propagation with Guarantees in Wasserstein Distance

    eess.SY 2025-06 conditional novelty 7.0 of 10

    An algorithm that approximates the pushforward of a Wasserstein-ambiguous distribution by a discrete distribution, with provable error bounds that vanish as the number of support points grows and stay bounded over inf...

  2. Wasserstein-regularized Conformal Prediction under General Distribution Shift

    cs.LG 2025-01 conditional novelty 6.0 of 10

    Conformal prediction coverage gaps under joint distribution shift can be upper bounded by Wasserstein distance and reduced by importance weighting plus a Wasserstein-regularized training objective.

Pith tools