Asymptotics for Strassen's Optimal Transport Problem

12/04/2019
by   Lei Yu, et al.
0

In this paper, we consider Strassen's version of optimal transport problem. That is, we minimize the excess-cost probability (i.e., the probability that the cost is larger than a given value) over all couplings of two distributions. We derive large deviation, moderate deviation, and central limit theorems for this problem. Our approach is based on Strassen's dual formulation of the optimal transport 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 optimal transport problem, a nested optimal transport formula for Strassen's optimal transport problem is derived. In this nested formula, the cost function of the outer optimal transport subproblem is set to the optimal transport functional (i.e., the mapping from a pair of distributions to the optimal transport cost for this pair of distributions) of the inner optimal transport subproblem. Based on this nested formula, we carefully design asymptotically optimal solutions to Strassen's optimal transport problem and its dual formulation. Finally, we connect Strassen's optimal transport problem to the empirical optimal transport problem, which hence provides an application for our results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2019

Asymptotics of Strassen's Optimal Transport Problem

In this paper, we consider Strassen's version of optimal transport probl...
research
04/30/2021

Limit Distributions and Sensitivity Analysis for Entropic Optimal Transport on Countable Spaces

For probability measures supported on countable spaces we derive limit d...
research
04/19/2022

An improved central limit theorem and fast convergence rates for entropic transportation costs

We prove a central limit theorem for the entropic transportation cost be...
research
11/15/2018

Guiding the One-to-one Mapping in CycleGAN via Optimal Transport

CycleGAN is capable of learning a one-to-one mapping between two data di...
research
09/25/2019

Optimal Transport, CycleGAN, and Penalized LS for Unsupervised Learning in Inverse Problems

The penalized least squares (PLS) is a classic approach to inverse probl...
research
07/06/2020

On the Connection between Dynamical Optimal Transport and Functional Lifting

Functional lifting methods provide a tool for approximating solutions of...
research
11/16/2020

Optimal Transport-based Coverage Control for Swarm Robot Systems: Generalization of the Voronoi Tessellation-based Method

Swarm robot systems, which consist of many cooperating mobile robots, ha...

Please sign up or login with your details

Forgot password? Click here to reset