Related papers: Optimal transport with nonlinear mobilities: a det…
We study discretizations of Hamiltonian systems on the probability density manifold equipped with the $L^2$-Wasserstein metric. Based on discrete optimal transport theory, several Hamiltonian systems on graph (lattice) with different…
In this paper we introduce a Wasserstein-type distance on the set of Gaussian mixture models. This distance is defined by restricting the set of possible coupling measures in the optimal transport problem to Gaussian mixture models. We…
We develop structure preserving schemes for a class of nonlinear mobility continuity equation. When the mobility is a concave function, this equation admits a form of gradient flow with respect to a Wasserstein-like transport metric. Our…
Many machine learning problems can be seen as approximating a \textit{target} distribution using a \textit{particle} distribution by minimizing their statistical discrepancy. Wasserstein Gradient Flow can move particles along a path that…
Optimal transport has gained much attention in image processing field, such as computer vision, image interpolation and medical image registration. Recently, Bredies et al. (ESAIM:M2AN 54:2351-2382, 2020) and Schmitzer et al. (IEEE T MED…
Classical optimal transport problem seeks a transportation map that preserves the total mass betwenn two probability distributions, requiring their mass to be the same. This may be too restrictive in certain applications such as color or…
We study the convergence of divergence-regularized optimal transport as the regularization parameter vanishes. Sharp rates for general divergences including relative entropy or $L^{p}$ regularization, general transport costs and…
Quadratic Wasserstein distances are obtained between dynamical systems (with states as special case), on $\mathbb{Z}_2$-graded von Neumann algebras. This is achieved through a systematic translation from non-graded to $\mathbb{Z}_2$-graded…
We introduce a version of Stein's method of comparison of operators specifically tailored to the problem of bounding the Wasserstein-1 distance between continuous and discrete distributions on the real line. Our approach rests on a new…
We consider finite-volume approximations of Fokker-Planck equations on bounded convex domains in $\mathbb{R}^d$ and study the corresponding gradient flow structures. We reprove the convergence of the discrete to continuous Fokker-Planck…
We study a nonlinear, degenerate cross-diffusion model which involves two densities with two different drift velocities. A general framework is introduced based on its gradient flow structure in Wasserstein space to derive a notion of…
We study first-order optimality conditions for constrained optimization in the Wasserstein space, whereby one seeks to minimize a real-valued function over the space of probability measures endowed with the Wasserstein distance. Our…
In this work we study systems consisting of a group of moving particles. In such systems, often some important parameters are unknown and have to be estimated from observed data. Such parameter estimation problems can often be solved via a…
We develop a general approach to setting up and studying classes of quantum dynamical systems close to and structurally similar to systems having specified properties, in particular detailed balance. This is done in terms of transport plans…
We formulate a class of velocity-free finite-particle methods for mass transport problems based on a time-discrete incremental variational principle that combines entropy and the cost of particle transport, as measured by the Wasserstein…
Since the introduction of the Sliced Wasserstein distance in the literature, its simplicity and efficiency have made it one of the most interesting surrogate for the Wasserstein distance in image processing and machine learning. However,…
In this paper, we apply the framework of optimal transport to the formulation of optimal design problems. By considering the Wasserstein space as a set of design variables, we associate each probability measure with a shape configuration of…
In this paper, we consider the problem of propagating an uncertain distribution by a possibly non-linear function and quantifying the resulting uncertainty. We measure the uncertainty using the Wasserstein distance, and for a given input…
This paper provides a simple procedure to fit generative networks to target distributions, with the goal of a small Wasserstein distance (or other optimal transport costs). The approach is based on two principles: (a) if the source…
We study a model of crowd motion following a gradient vector field, with possibly additional interaction terms such as attraction/repulsion, and we present a numerical scheme for its solution through a Lagrangian discretization. The density…