English
Related papers

Related papers: Pathwise optimal transport bounds between a one-di…

200 papers

For a fixed $T$ and $k \geq 2$, a $k$-dimensional vector stochastic differential equation $dX_t=\mu(X_t, \theta)dt+\nu(X_t)dW_t,$ is studied over a time interval $[0,T]$. Vector of drift parameters $\theta$ is unknown. The dependence in…

Statistics Theory · Mathematics 2023-07-19 Miljenko Huzak , Snježana Lubura Strunjak , Andreja Vlahek Štrok

We show the $L^2$-Wasserstein contraction for the transition kernel of a discretised diffusion process, under a contractivity at infinity condition on the drift and a sufficiently high diffusivity requirement. This extends recent results…

Probability · Mathematics 2023-10-25 Linshan Liu , Mateusz B. Majka , Pierre Monmarché

We propose a new generalization to quantum states of the Wasserstein distance, which is a fundamental distance between probability distributions given by the minimization of a transport cost. Our proposal is the first where the transport…

Mathematical Physics · Physics 2021-09-21 Giacomo De Palma , Dario Trevisan

We consider the optimization problem of minimizing a functional defined over a family of probability distributions, where the objective functional is assumed to possess a variational form. Such a distributional optimization problem arises…

Machine Learning · Computer Science 2024-04-02 Zhuoran Yang , Yufeng Zhang , Yongxin Chen , Zhaoran Wang

Optimal transport provides an inherently geometric and highly structured framework for studying spaces of probability measures, supplying a rich theoretical toolkit for contemporary statistics, machine learning, and generative modelling. In…

Statistics Theory · Mathematics 2026-05-21 Riccardo Passeggeri , Rohan M. Shenoy , Pengcheng Ye

The Wasserstein distance is a metric on a space of probability measures that has seen a surge of applications in statistics, machine learning, and applied mathematics. However, statistical aspects of Wasserstein distances are bottlenecked…

Probability · Mathematics 2022-03-02 Ziv Goldfeld , Kengo Kato , Sloan Nietert , Gabriel Rioux

Optimal transport (OT) distances are increasingly used as loss functions for statistical inference, notably in the learning of generative models or supervised learning. Yet, the behavior of minimum Wasserstein estimators is poorly…

Statistics Theory · Mathematics 2021-07-20 Tianyi Lin , Zeyu Zheng , Elynn Y. Chen , Marco Cuturi , Michael I. Jordan

Resource-efficiently computing representations of probability distributions and the distances between them while only having access to the samples is a fundamental and useful problem across mathematical sciences. In this paper, we propose a…

Machine Learning · Computer Science 2025-06-19 Debabrota Basu , Debarshi Chanda

Let $M$ be a compact connected Riemannian manifold possibly with a boundary, let $V\in C^2(M)$ such that $\mu(d x):=e^{V(x)}d x$ is a probability measure, and let $\{\lambda_i\}_{i\ge 1} $ be all non-trivial eigenvalues of $-L$ with Neumann…

Probability · Mathematics 2021-12-21 Feng-Yu Wang , Jie-Xiang Zhu

We revisit the question of characterizing the convergence rate of plug-in estimators of optimal transport costs. It is well known that an empirical measure comprising independent samples from an absolutely continuous distribution on…

Probability · Mathematics 2024-02-06 Tudor Manole , Jonathan Niles-Weed

We investigate long-time behaviors of empirical measures associated with subordinated Dirichlet diffusion processes on a compact Riemannian manifold $M$ with boundary $\partial M$ to some reference measure, under the quadratic Wasserstein…

Probability · Mathematics 2022-06-09 Huaiqian Li , Bingyao Wu

In this paper, we prove a structure theorem for discrete optimal transportation plans. We show that, given any pair of discrete probability measures and a cost function, there exists an optimal transportation plan that can be expressed as…

Optimization and Control · Mathematics 2021-04-28 Gennaro Auricchio , Marco Veneroni

Given any closed Riemannian manifold $M$, we construct a reversible diffusion process on the space ${\mathcal P}(M)$ of probability measures on $M$ that is (i) reversible w.r.t.~the entropic measure ${\mathbb P}^\beta$ on ${\mathcal P}(M)$,…

Probability · Mathematics 2024-04-25 Karl-Theodor Sturm

This paper contains two contributions in the study of optimal transport on metric graphs. Firstly, we prove a Benamou-Brenier formula for the Wasserstein distance, which establishes the equivalence of static and dynamical optimal transport.…

Analysis of PDEs · Mathematics 2022-05-02 Matthias Erbar , Dominik Forkert , Jan Maas , Delio Mugnolo

We study the existence and long-time asymptotics of weak solutions to a system of two nonlinear drift-diffusion equations that has a gradient flow structure in the Wasserstein distance. The two equations are coupled through a…

Analysis of PDEs · Mathematics 2021-12-14 Lisa Beck , Daniel Matthes , Martina Zizza

The theory of optimal transport of probability measures has wide-ranging applications across a number of different fields, including concentration of measure, machine learning, Markov chains, and economics. The generalisation of optimal…

Quantum Physics · Physics 2026-04-21 Emily Beatty

In this note, we provide a unified framework for the mean square stability of stochastic jump linear systems via optimal transport. The Wasserstein metric known as an optimal transport, that assesses the distance between probability density…

Systems and Control · Computer Science 2014-03-12 Kooktae Lee , Abhishek Halder , Raktim Bhattacharya

We present a simple approach to study the one-dimensional pressureless Euler system via adhesion dynamics in the Wasserstein space of probability measures with finite quadratic moments. Starting from a discrete system of a finite number of…

Analysis of PDEs · Mathematics 2014-09-16 Luca Natile , Giuseppe Savaré

We define a novel class of distances between statistical multivariate distributions by modeling an optimal transport problem on their marginals with respect to a ground distance defined on their conditionals. These new distances are metrics…

Machine Learning · Computer Science 2020-11-03 Frank Nielsen , Ke Sun

In the context of kernel methods, the similarity between data points is encoded by the kernel function which is often defined thanks to the Euclidean distance, a common example being the squared exponential kernel. Recently, other distances…

Machine Learning · Computer Science 2020-02-06 Henri De Plaen , Michaël Fanuel , Johan A. K. Suykens