相关论文: H\"older continuity and injectivity of optimal map…

Consider the problem of optimally matching two measures on the circle, or equivalently two periodic measures on the real line, and suppose the cost of matching two points satisfies the Monge condition. We introduce a notion of locally…

This paper deals with a variant of the optimal transportation problem. Given f $\in$ L 1 (R d , [0, 1]) and a cost function c $\in$ C(R d x R d) of the form c(x, y) = k(y -- x), we minimise $\int$ c d$\gamma$ among transport plans $\gamma$…

This paper presents a unified framework for smooth convex regularization of discrete optimal transport problems. In this context, the regularized optimal transport turns out to be equivalent to a matrix nearness problem with respect to…

We give a new proof of the Caffarelli contraction theorem, which states that the Brenier optimal transport map sending the standard Gaussian measure onto a uniformly log-concave probability measure is Lipschitz. The proof combines a recent…

The optimal transport (OT) map is a geometry-driven transformation between high-dimensional probability distributions which underpins a wide range of tasks in statistics, applied probability, and machine learning. However, existing…

The inverse optimal transport problem is to find the underlying cost function from the knowledge of optimal transport plans. While this amounts to solving a linear inverse problem, in this work we will be concerned with the nonlinear…

Let $A$ be an $n\times n$ random matrix with independent rows $R_1(A),\dots,R_n(A)$, and assume that for any $i\leq n$ and any three-dimensional linear subspace $F\subset {\mathbb R}^n$ the orthogonal projection of $R_i(A)$ onto $F$ has…

For $0<p<+\infty$, we prove a global $W^{2,p}$-estimate for potentials of optimal transport maps between convex domains in the plane. Among the tools developed for that purpose are obliqueness in general convex domains and estimates for the…

In this paper, we consider the Monge optimal transport problem with distance cost. We prove that in some metric spaces, possibly with many branching geodesics, an optimal transport map exists if the first marginal is absolutely continuous.…

We investigate the small regularization limit of entropic optimal transport when the cost function is the Euclidean distance in dimensions $d > 1$, and the marginal measures are absolutely continuous with respect to the Lebesgue measure.…

We investigate the convergence rate of the optimal entropic cost $v_\varepsilon$ to the optimal transport cost as the noise parameter $\varepsilon \downarrow 0$. We show that for a large class of cost functions $c$ on $\mathbb{R}^d\times…

Caffarelli's contraction theorem bounds the derivative of the optimal transport map between a log-convex measure and a strongly log-concave measure. We show that an analogous phenomenon holds on the level of the trace: The trace of the…

For probability measures $\mu,\nu$ and $\rho$ define the cost functionals \begin{align*} C(\mu,\rho):=\sup_{\pi\in \Pi(\mu,\rho)} \int \langle x,y\rangle\, \pi(dx,dy),\quad C(\nu,\rho):=\sup_{\pi\in \Pi(\nu,\rho)} \int \langle x,y\rangle\,…

We introduce a new optimal transport distance between nonnegative finite Radon measures with possibly different masses. The construction is based on non-conservative continuity equations and a corresponding modified Benamou-Brenier formula.…

The nonlinear wave equation $u_{tt}-c(u)(c(u)u_x)_x=0$ determines a flow of conservative solutions taking values in the space $H^1(\mathbb{R})$. However, this flow is not continuous w.r.t. the natural $H^1$ distance. Aim of this paper is to…

This article presents a general approximation-theoretic framework to analyze measure transport algorithms for probabilistic modeling. A primary motivating application for such algorithms is sampling -- a central task in statistical…

We present a systematic study of conditional triangular transport maps in function spaces from the perspective of optimal transportation and with a view towards amortized Bayesian inference. More specifically, we develop a theory of…

For a bounded closed convex set $K$, in this note, we study the FPP for $\alpha$-H\"older nonexpansive maps, i.e. mappings $T\colon K\to K$ for which $\|T x -Ty\| \leq\| x - y\|^\alpha$ for all $x, y\in K$, $\alpha\in (0,1)$. First, we note…

The goal of the present work is to study optimal transport on null hypersurfaces inside Lorentzian manifolds. The challenge here is that optimal transport along a null hypersurface is completely degenerate, as the cost takes only the two…

From optimal transport to robust dimensionality reduction, a plethora of machine learning applications can be cast into the min-max optimization problems over Riemannian manifolds. Though many min-max algorithms have been analyzed in the…