Related papers: Minimizing optimal transport for functions with fi…
The dynamic formulation of optimal transport, also known as the Benamou-Brenier formulation, has been extended to the unbalanced case by introducing a source term in the continuity equation. When this source term is penalized based on the…
Let $f$ be a martingale with values in a uniformly $p$-smooth Banach space and $w$ any positive weight. We show that $\mathbb{E} (f^* \cdot w) \lesssim \mathbb{E}(S_p f \cdot w^*)$, where $\cdot^*$ is the martingale maximal operator and…
Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…
This paper studies sampling error bounds for denoising diffusion probabilistic models (DDPMs) in the 2-Wasserstein distance. Our contributions are threefold. (i) Under general Lipschitz-type conditions on the score function and for a broad…
An easy consequence of Kantorovich-Rubinstein duality is the following: if $f:[0,1]^d \rightarrow \infty$ is Lipschitz and $\left\{x_1, \dots, x_N \right\} \subset [0,1]^d$, then $$ \left| \int_{[0,1]^d} f(x) dx - \frac{1}{N}…
We study Fokker--Planck equations with symmetric, positive definite mobility matrices capturing diffusion in heterogeneous environments. A weighted Wasserstein metric is introduced for which these equations are gradient flows. This metric…
We obtain the sharp version of the uncertainty principle recently introduced in [47], and improved by [13], relating the size of the zero set of a continuous function having zero mean and the optimal transport cost between the mass of the…
Given a determinate (multivariate) probability measure $\mu$, we characterize Gaussian mixtures $\nu\_\phi$ which minimize the Wasserstein distance $W\_2(\mu,\nu\_\phi)$ to $\mu$ when the mixing probability measure $\phi$ on the parameters…
In this paper, we prove existence of $L^p$-optimal transport maps with $p \in (1,\infty)$ in a class of branching metric spaces defined on $\mathbb{R}^N$. In particular, we introduce the notion of cylinder-like convex function and we prove…
We propose a fundamental metric for measuring the distance between two distributions. This metric, referred to as the decision-focused (DF) divergence, is tailored to stochastic linear optimization problems in which the objective…
We study a generalization of the Monge--Kantorovich optimal transport problem. Given a prescribed family of time-dependent probability measures $(\mu_t)$, we aim to find, among all path-continuous stochastic processes whose one-dimensional…
We develop the theory of a metric, which we call the $\nu$-based Wasserstein metric and denote by $W_\nu$, on the set of probability measures $\mathcal P(X)$ on a domain $X \subseteq \mathbb{R}^m$. This metric is based on a slight…
The central limit theorem is one of the most fundamental results in probability and has been successfully extended to locally dependent data and strongly-mixing random fields. In this paper, we establish its rate of convergence for…
In this work, the problem of shape optimization, subject to PDE constraints, is reformulated as an $L^p$ best approximation problem under divergence constraints to the shape tensor introduced in Laurain and Sturm: ESAIM Math. Model. Numer.…
We propose a family of relaxations of the optimal transport problem which regularize the problem by introducing an additional minimization step over a small region around one of the underlying transporting measures. The type of…
Under general assumptions on the target distribution $p^\star$, we establish a sharp Lipschitz regularity theory for flow-matching vector fields and diffusion-model scores, with optimal dependence on time and dimension. As applications, we…
The transportation $\mathrm{L}^p$ distance, denoted $\mathrm{TL}^p$, has been proposed as a generalisation of Wasserstein $\mathrm{W}^p$ distances motivated by the property that it can be applied directly to colour or multi-channelled…
We establish conditions to characterize probability measures by their $L^{p}$-quantization error functions in both $\mathbb{R}^{d}$ and Hilbert settings. This characterization is two-fold: static (identity of two distributions) and dynamic…
Optimal transport is widely used in pure and applied mathematics to find probabilistic solutions to hard combinatorial matching problems. We extend the Wasserstein metric and other elements of optimal transport from the matching of sets to…
We introduce a formulation of optimal transport problem for distributions on function spaces, where the stochastic map between functional domains can be partially represented in terms of an (infinite-dimensional) Hilbert-Schmidt operator…