Asymptotics for Strassen's optimal transport problem
From MaRDI portal
Publication:6187899
Abstract: In this paper, we consider Strassen's version of optimal transport (OT) problem, which concerns minimizing the excess-cost probability (i.e., the probability that the cost is larger than a given value) over all couplings of two given distributions. We derive large deviation, moderate deviation, and central limit theorems for this problem. Our proof is based on Strassen's dual formulation of the OT problem, Sanov's theorem on the large deviation principle (LDP) of empirical measures, as well as the moderate deviation principle (MDP) and central limit theorems (CLT) of empirical measures. In order to apply the LDP, MDP, and CLT to Strassen's OT problem, nested formulas for Strassen's OT problem are derived. Based on these nested formulas and using a splitting technique, we construct asymptotically optimal solutions to Strassen's OT problem and its dual formulation.
Recommendations
- Central limit theorems for general transportation costs
- Asymptotic analysis of the optimal cost in some transportation problems with random locations
- On a mixture of Brenier and Strassen theorems
- Central limit theorems for empirical transportation cost in general dimension
- Asymptotics for semidiscrete entropic optimal transport
Cites work
- scientific article; zbMATH DE number 3624579 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3245885 (Why is no real title available?)
- A New Approach to the Limit Theory of Recurrent Markov Chains
- A PDE approach to a 2-dimensional matching problem
- A large deviation approach to some transportation cost inequalities
- Asymptotic Coupling and Its Applications in Information Theory
- Asymptotics for transportation cost in high dimensions
- Central limit theorems for empirical transportation cost in general dimension
- Central limit theorems for the Wasserstein distance between the empirical and the true distributions
- Covert Communication Over Noisy Channels: A Resolvability Perspective
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- Fundamental Limits of Communication With Low Probability of Detection
- General state space Markov chains and MCMC algorithms
- Inference for empirical Wasserstein distances on finite spaces
- Information theory. Coding theorems for discrete memoryless systems
- Large and moderate deviations for matching problems and empirical discrepancies
- Large deviations techniques and applications.
- Large deviations, moderate deviations and LIL for empirical processes
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Matching random samples in many dimensions
- On Choosing and Bounding Probability Metrics
- On optimal matchings
- On the mean speed of convergence of empirical and occupation measures in Wasserstein distance
- On the rate of convergence in Wasserstein distance of the empirical measure
- Rényi Divergence and Kullback-Leibler Divergence
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- The Existence of Probability Measures with Given Marginals
- The Speed of Mean Glivenko-Cantelli Convergence
- The earth mover's distance as a metric for image retrieval
- The integrability of the square exponential transportation cost
- The transportation cost from the uniform measure to the empirical measure in dimension \(\geq 3\)
- Wasserstein dictionary learning: optimal transport-based unsupervised nonlinear dictionary learning
This page was built for publication: Asymptotics for Strassen's optimal transport problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187899)
