Related papers: Central Limit Theorems for General Transportation …
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost $c(x,y)$ which is not finite everywhere, but coincides with $|x-y|^2$ if the displacement $y-x$ belongs to a given convex set $C$ and it is…
We consider optimal transportation of measures on metric and topological spaces in the case where the cost function and marginal distributions depend on a parameter with values in a metric space. The Hausdorff distance between the sets of…
Understanding the generalization of deep neural networks is one of the most important tasks in deep learning. Although much progress has been made, theoretical error bounds still often behave disparately from empirical observations. In this…
The basic problem of optimal transportation consists in minimizing the expected costs $\mathbb {E}[c(X_1,X_2)]$ by varying the joint distribution $(X_1,X_2)$ where the marginal distributions of the random variables $X_1$ and $X_2$ are…
The paper is devoted to the geometry of transportation cost spaces and their generalizations introduced by Melleray, Petrov, and Vershik (2008). Transportation cost spaces are also known as Arens-Eells, Lipschitz-free, or Wasserstein $1$…
The presentation covers prerequisite results from Topology and Measure Theory. This is then followed by an introduction into couplings and basic definitions for optimal transport. The Kantrorovich problem is then introduced and an existence…
We give an overview of various results and methods related to information-theoretic distances of R\'enyi type in the light of their applications to the central limit theorem (CLT). The first part (Sections 1-9) is devoted to the total…
We consider an optimal transportation problem with more than two marginals. We use a family of semi-Riemannian metrics derived from the mixed, second order partial derivatives of the cost function to provide upper bounds for the dimension…
This work focuses on the temporal average of the backward Euler--Maruyama (BEM) method, which is used to approximate the ergodic limit of stochastic ordinary differential equations with super-linearly growing drift coefficients. We give the…
We show how the renormalization group approach can be used to prove quantitative central limit theorems (CLTs) in the setting of free, Boolean, bi-free and bi-Boolean independence under finite third moment assumptions. The proofs rely on…
This paper introduces the first statistically consistent estimator of the optimal transport map between two probability distributions, based on neural networks. Building on theoretical and practical advances in the field of Lipschitz neural…
The stability of solutions to optimal transport problems under variation of the measures is fundamental from a mathematical viewpoint: it is closely related to the convergence of numerical approaches to solve optimal transport problems and…
An efficient method for computing solutions to the Optimal Transportation (OT) problem with a wide class of cost functions is presented. The standard linear programming (LP) discretization of the continuous problem becomes intractible for…
We analyze several problems of Optimal Transport Theory in the setting of Ergodic Theory. In a certain class of problems we consider questions in Ergodic Transport which are generalizations of the ones in Ergodic Optimization. Another class…
We are interested in the Wasserstein distance between two probability measures on $\R^n$ sharing the same copula $C$. The image of the probability measure $dC$ by the vectors of pseudo-inverses of marginal distributions is a natural…
We consider the problem of solving the optimal transport problem between two empirical distributions with missing values. Our main assumption is that the data is missing completely at random (MCAR), but we allow for heterogeneous…
The optimal transportation problem, first suggested by Gaspard Monge in the 18th century and later revived in the 1940s by Leonid Kantorovich, deals with the question of transporting a certain measure to another, using transport maps or…
The central limit theorem for convex bodies says that with high probability the marginal of an isotropic log-concave distribution along a random direction is close to a Gaussian, with the quantitative difference determined asymptotically by…
We prove transportation-cost inequalities for the law of SDE solutions driven by general Gaussian processes. Examples include the fractional Brownian motion, but also more general processes like bifractional Brownian motion. In case of…
In this note we prove estimates for the average cost in the quadratic optimal transport problem on the two-dimensional flat torus which are optimal up to a double logarithm. We also prove sharp estimates on the displacement. This is based…