Related papers: Strong c-concavity and stability in optimal transp…
An optimal transport problem on finite spaces is a linear program. Recently, a relaxation of the optimal transport problem via strictly convex functions, especially via the Kullback--Leibler divergence, sheds new light on data sciences.…
We study the inverse optimal transport problem of recovering the ground cost from an optimal transport plan. In discrete settings, this problem reduces to inverse linear programming and is intrinsically ill-posed, exhibiting…
The Ma-Trudinger-Wang curvature --- or cross-curvature --- is an object arising in the regularity theory of optimal transportation. If the transportation cost is derived from a Hamiltonian action, we show its cross-curvature can be…
Two recent works, Avella-Medina and Gonz\'alez-Sanz (2026) and Passeggeri and Paindaveine (2026), studied the robustness of the optimal transport map through its breakdown point, i.e., the smallest fraction of contamination that can make…
We study the entropic regularizations of optimal transport problems under suitable summability assumptions on the point-wise transport cost. These summability assumptions already appear in the literature. However, we show that the weakest…
We consider the problem of comparing several samples of stochastic processes with respect to their second-order structure, and describing the main modes of variation in this second order structure, if present. These tasks can be seen as an…
In this note, we derive upper-bounds on the statistical estimation rates of unbalanced optimal transport (UOT) maps for the quadratic cost. Our work relies on the stability of the semi-dual formulation of optimal transport (OT) extended to…
We construct homogeneous optimal transport maps for the quadratic cost between convex cones with homogeneous, possibly degenerate, densities when the cones satisfy an obliqueness condition. The existence of such maps plays a central role in…
Nonnegative cross-curvature (NNCC) is a geometric property of a cost function defined on a product space that originates in optimal transportation and the Ma-Trudinger-Wang theory. Motivated by applications in optimization, gradient flows…
We present an optimal transport framework for performing regression when both the covariate and the response are probability distributions on a compact Euclidean subset $\Omega\subset\mathbb{R}^d$, where $d>1$. Extending beyond compactly…
Optimal transport has recently started to be successfully employed to define misfit or loss functions in inverse problems. However, it is a problem intrinsically defined for positive (probability) measures and therefore strategies are…
Multi-marginal optimal transport plans are concentrated on c-splitting sets. It is known that, similar to the two-marginal case, c-splitting sets are c-cyclically monotone. Within a suitable framework, the converse implication was very…
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…
Optimal transport has recently been brought forward as a tool for modeling and efficiently solving a variety of flow problems, such as origin-destination problems and multi-commodity flow problems. Although the framework has shown to be…
We study the optimal transport problem in the Euclidean space where the cost function is given by the value function associated with a Linear Quadratic minimization problem. Under appropriate assumptions, we generalize Brenier's Theorem…
The problem of robust hedging requires to solve the problem of superhedging under a nondominated family of singular measures. Recent progress was achieved by [9,11]. We show that the dual formulation of this problem is valid in a context…
In this paper, we want to establish some general results in the Lorentzian optimal transport theory that have well-known Riemannian counterparts. As a first result, we will provide non-trivial assumptions on the measures to ensure strong…
We prove discrete-to-continuum convergence for dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with energy density having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer,…
We study the information geometry of $\bcc$-divergences from families of costs of the form $\mathsf{c}(x, \barx) =\mathsf{u}(x^{\mathfrak{t}}\barx)$ through the optimal transport point of view. Here, $\mathsf{u}$ is a scalar function with…
We present several theorems on strict and strong convexity, and higher order differential formulae for sandwiched quasi-relative entropy (a parametrised version of the classical fidelity). These are crucial for establishing global linear…