Related papers: Radon--Wasserstein Gradient Flows for Interacting-…
We present a computationally efficient framework, called $\texttt{FlowDRO}$, for solving flow-based distributionally robust optimization (DRO) problems with Wasserstein uncertainty sets while aiming to find continuous worst-case…
Otto's (2001) Wasserstein gradient flow of the exclusive KL divergence functional provides a powerful and mathematically principled perspective for analyzing learning and inference algorithms. In contrast, algorithms for the inclusive KL…
We consider a Fokker-Planck equation which is coupled to an externally given time-dependent constraint on its first moment. This constraint introduces a Lagrange-multiplier which renders the equation nonlocal and nonlinear. In this paper we…
This paper presents existence and uniqueness results for a class of parabolic systems with non linear diffusion and nonlocal interaction. These systems can be viewed as regular perturbations of Wasserstein gradient flows. Here we extend…
In the present article, novel Coarse-Graining (CG) algorithms for the Eulerian-Lagrangian (EL) simulation of particle-laden flows are proposed. These include different variants of Reproducing Kernel Particle Methods (RKPM) and an extended…
We develop a fast and scalable numerical approach to solve Wasserstein gradient flows (WGFs), particularly suitable for high-dimensional cases. Our approach is to use general reduced-order models, like deep neural networks, to parameterize…
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…
The propagation of gradient flow structures from microscopic to macroscopic models is a topic of high current interest. In this paper we discuss this propagation in a model for the diffusion of particles interacting via hard-core exclusion…
We analyze gradient flows with jumps generated by a finite set of complete vector fields in involution using some Radon measures $u\in \mathcal{U}_a$ as admissible perturbations. Both the evolution of a bounded gradient flow $\{x^u(t,\l)\in…
We introduce a new family of particle evolution samplers suitable for constrained domains and non-Euclidean geometries. Stein Variational Mirror Descent and Mirrored Stein Variational Gradient Descent minimize the Kullback-Leibler (KL)…
This paper investigates the gradient flow structure, well-posedness, and asymptotic behavior of the Fokker-Planck equation defined on locally uniformly finite graphs, which is highly non-trivial compared with the finite case. We first…
This is in the sequel of authors' paper \cite{LPW} in which we had set up a program to verify rigorously some formal statements associated with the multiple component phase transitions with higher dimensional wells. The main goal here is to…
We propose a mathematically principled PDE gradient flow framework for distributionally robust optimization (DRO). Exploiting the recent advances in the intersection of Markov Chain Monte Carlo sampling and gradient flow theory, we show…
In this article we set up a splitting variant of the JKO scheme in order to handle gradient flows with respect to the Kantorovich-Fisher-Rao metric, recently introduced and defined on the space of positive Radon measure with varying masses.…
The Poisson-Nernst-Planck system of equations used to model ionic transport is interpreted as a gradient flow for the Wasserstein distance and a free energy in the space of probability measures with finite second moment. A variational…
We study fast and reliable generative transport for the 3D KS (Keller-Segel) and KPP (Kolmogorov-Petrovsky-Piskunov) equations in the presence of fluid flows with the goal to approximate the map between initial and terminal distributions…
In this paper we bring together some of the key ideas and methods of two disparate fields of mathematical research, frame theory and optimal transport, using the methods of the second to answer questions posed in the first. In particular,…
We provide a numerical analysis and computation of neural network projected schemes for approximating one dimensional Wasserstein gradient flows. We approximate the Lagrangian mapping functions of gradient flows by the class of two-layer…
The Wasserstein probability metric has received much attention from the machine learning community. Unlike the Kullback-Leibler divergence, which strictly measures change in probability, the Wasserstein metric reflects the underlying…
Sliced Wasserstein (SW) distance has been widely used in different application scenarios since it can be scaled to a large number of supports without suffering from the curse of dimensionality. The value of sliced Wasserstein distance is…