Parameterized Wasserstein Gradient Flow
Yijie Jin, Shu Liu, Hao Wu, Xiaojing Ye, Haomin Zhou
TL;DR
This work introduces Parameterized Wasserstein Gradient Flow (PWGF), a scalable framework for solving high-dimensional Wasserstein gradient flows by parameterizing push-forward maps with neural networks and evolving a finite-dimensional parameter set. Central to PWGF is a new pullback Wasserstein metric that defines a tractable gradient flow on the parameter space: $\dot{\theta} = -\widehat{G}(\theta)^{\dagger} \nabla_{\theta} F(\theta)$, where $F(\theta)=\mathcal{F}(\rho_\theta)$ and $\rho_\theta = T_\theta\#\rho_{\text{ref}}$. The paper provides rigorous Wasserstein-distance error bounds between the PWGF approximation and the true WGF solution, develops a forward-Euler numerical scheme with a MINRES solver for the linear system, and demonstrates accuracy and computational efficiency on the Fokker–Planck equation, porous medium equation, and an aggregation model. The results show that the approach yields accurate density evolution and fast sampling in high dimensions, without spatial discretization or expensive nonconvex optimization, making it a practical tool for high-dimensional density evolution and related statistical applications.
Abstract
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 the push-forward maps such that they can push a simple reference density to the one solving the given WGF. The new dynamical system is called parameterized WGF (PWGF), and it is defined on the finite-dimensional parameter space equipped with a pullback Wasserstein metric. Our numerical scheme can approximate the solutions of WGFs for general energy functionals effectively, without requiring spatial discretization or nonconvex optimization procedures, thus avoiding some limitations of classical numerical methods and more recent deep-learning-based approaches. A comprehensive analysis of the approximation errors measured by Wasserstein distance is also provided in this work. Numerical experiments show promising computational efficiency and verified accuracy on various WGF examples using our approach.
