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
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.
Forward citations
Cited by 2 Pith papers
-
Efficient Uncertainty Propagation with Guarantees in Wasserstein Distance
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...
-
Wasserstein-regularized Conformal Prediction under General Distribution Shift
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.
Discussion (0). Continue with ORCID to comment.