The Directional Optimal Transport

02/20/2020
by   Marcel Nutz, et al.
0

We introduce a constrained optimal transport problem where origins x can only be transported to destinations y≥ x. Our statistical motivation is to describe the sharp upper bound for the variance of the treatment effect Y-X given marginals when the effect is monotone, or Y≥ X. We thus focus on supermodular costs (or submodular rewards) and introduce a coupling P_* that is optimal for all such costs and yields the sharp bound. This coupling admits manifold characterizations—geometric, order-theoretic, as optimal transport, through the cdf, and via the transport kernel—that explain its structure and imply useful bounds. When the first marginal is atomless, P_* is concentrated on the graphs of two maps which can be described in terms of the marginals, the second map arising due to the binding constraint.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2022

Kernel Neural Optimal Transport

We study the Neural Optimal Transport (NOT) algorithm which uses the gen...
research
08/30/2022

Convergence Rates for Regularized Optimal Transport via Quantization

We study the convergence of divergence-regularized optimal transport as ...
research
12/17/2021

Probabilistic Inverse Optimal Transport

Optimal transport (OT) formalizes the problem of finding an optimal coup...
research
07/24/2023

Policy Gradient Optimal Correlation Search for Variance Reduction in Monte Carlo simulation and Maximum Optimal Transport

We propose a new algorithm for variance reduction when estimating f(X_T)...
research
05/14/2023

From Soft-Minoration to Information-Constrained Optimal Transport and Spiked Tensor Models

Let P_Z be a given distribution on ℝ^n. For any y∈ℝ^n, we may interpret ...
research
10/24/2022

Budget-Constrained Bounds for Mini-Batch Estimation of Optimal Transport

Optimal Transport (OT) is a fundamental tool for comparing probability d...

Please sign up or login with your details

Forgot password? Click here to reset