Optimal Transport in the Face of Noisy Data

02/08/2021
by   Bart P. G. Van Parys, et al.
0

Optimal transport distances are popular and theoretically well understood in the context of data-driven prediction. A flurry of recent work has popularized these distances for data-driven decision-making as well although their merits in this context are far less well understood. This in contrast to the more classical entropic distances which are known to enjoy optimal statistical properties. This begs the question when, if ever, optimal transport distances enjoy similar statistical guarantees. Optimal transport methods are shown here to enjoy optimal statistical guarantees for decision problems faced with noisy data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/12/2021

Optimal transport with some directed distances

We present a toolkit of directed distances between quantile functions. B...
research
09/09/2023

Comparing Morse Complexes Using Optimal Transport: An Experimental Study

Morse complexes and Morse-Smale complexes are topological descriptors po...
research
05/26/2017

Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration

Computing optimal transport distances such as the earth mover's distance...
research
05/03/2020

A Study of Performance of Optimal Transport

We investigate the problem of efficiently computing optimal transport (O...
research
06/01/2023

Training neural operators to preserve invariant measures of chaotic attractors

Chaotic systems make long-horizon forecasts difficult because small pert...
research
08/11/2022

Optimal Transport Features for Morphometric Population Analysis

Brain pathologies often manifest as partial or complete loss of tissue. ...
research
11/08/2021

Efficient estimates of optimal transport via low-dimensional embeddings

Optimal transport distances (OT) have been widely used in recent work in...

Please sign up or login with your details

Forgot password? Click here to reset