Related papers: Gradient flow formulation of diffusion equations i…
We propose a spatial discretization of the fourth-order nonlinear DLSS equation on the circle. Our choice of discretization is motivated by a novel gradient flow formulation with respect to a metric that generalizes martingale transport.…
Gradient descent-ascent (GDA) flows play a central role in finding saddle points of bivariate functionals, with applications in optimization, game theory, and robust control. While they are well-understood in Hilbert and Banach spaces via…
We formulate a trajectorial version of the relative entropy dissipation identity for McKean$-$Vlasov diffusions, extending the results of the papers [FJ16,KST20a], which apply to non-interacting diffusions. Our stochastic analysis approach…
Optimal transport (OT) provides powerful tools for comparing probability measures in various types. The Wasserstein distance which arises naturally from the idea of OT is widely used in many machine learning applications. Unfortunately,…
Gradient flow in the 2-Wasserstein space is widely used to optimize functionals over probability distributions and is typically implemented using an interacting particle system with $n$ particles. Analyzing these algorithms requires showing…
We study a system of drift-diffusion PDEs for a potentially infinite number of incompressible phases, subject to a joint pointwise volume constraint. Our analysis is based on the interpretation as a collection of coupled Wasserstein…
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…
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 examine the infinite-dimensional optimization problem of finding a decomposition of a probability measure into K probability sub-measures to minimize specific loss functions inspired by applications in clustering and user grouping. We…
Many tasks in machine learning and signal processing can be solved by minimizing a convex function of a measure. This includes sparse spikes deconvolution or training a neural network with a single hidden layer. For these problems, we study…
Solving Fredholm equations of the first kind is crucial in many areas of the applied sciences. In this work we adopt a probabilistic and variational point of view by considering a minimization problem in the space of probability measures…
We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows…
A relaxed notion of displacement convexity is defined and used to establish short time existence and uniqueness of Wasserstein gradient flows for higher order energy functionals. As an application, local and global well-posedness of…
Wasserstein distance (WD) and the associated optimal transport plan have been proven useful in many applications where probability measures are at stake. In this paper, we propose a new proxy of the squared WD, coined min-SWGG, that is…
Wasserstein gradient flows are continuous time dynamics that define curves of steepest descent to minimize an objective function over the space of probability measures (i.e., the Wasserstein space). This objective is typically a divergence…
We develop novel neural network-based implicit particle methods to compute high-dimensional Wasserstein-type gradient flows with linear and nonlinear mobility functions. The main idea is to use the Lagrangian formulation in the…
Motivated by a probabilistic approach to Kahler-Einstein metrics we consider a general non-equilibrium statistical mechanics model in Euclidean space consisting of the stochastic gradient flow of a given (possibly singular) quasi-convex…
Over the past fifteen years, the theory of Wasserstein gradient flows of convex (or, more generally, semiconvex) energies has led to advances in several areas of partial differential equations and analysis. In this work, we extend the…
In this work, we show that a family of non-linear mean-field equations on discrete spaces can be viewed as a gradient flow of a natural free energy functional with respect to a certain metric structure we make explicit. We also prove that…
This work considers the problem of computing distances between structured objects such as undirected graphs, seen as probability distributions in a specific metric space. We consider a new transportation distance (i.e. that minimizes a…