Radon--Wasserstein Gradient Flows for Interacting-Particle Sampling in High Dimensions
Elias Hess-Childs, Dejan Slepčev, Lantian Xu
TL;DR
The paper introduces Radon--Wasserstein (RW) and Regularized Radon--Wasserstein (RRW) gradient flows for KL divergence, enabling scalable high-dimensional sampling by basing velocities on one-dimensional projections. It develops Kernel-Density RW (KDRW) and RRW flows and their interacting-particle discretizations, with FFT-based accelerations that yield per-step costs of $O(nd)$. The authors establish well-posedness, stability, mean-field convergence, SGD convergence, and long-time convergence for RRW, and provide extensive experiments on Gaussian and Rosenbrock ('banana') targets, showing accurate sampling in high dimensions and favorable quantization relative to i.i.d. samples and SVGD. The framework offers a dimension-robust alternative to traditional MCMC/variational approaches, combining theoretical guarantees with practical efficiency for high-dimensional interacting-particle sampling.
Abstract
Gradient flows of the Kullback--Leibler (KL) divergence, such as the Fokker--Planck equation and Stein Variational Gradient Descent, evolve a distribution toward a target density known only up to a normalizing constant. We introduce new gradient flows of the KL divergence with a remarkable combination of properties: they admit accurate interacting-particle approximations in high dimensions, and the per-step cost scales linearly in both the number of particles and the dimension. These gradient flows are based on new transportation-based Riemannian geometries on the space of probability measures: the Radon--Wasserstein geometry and the related Regularized Radon--Wasserstein (RRW) geometry. We define these geometries using the Radon transform so that the gradient-flow velocities depend only on one-dimensional projections. This yields interacting-particle-based algorithms whose per-step cost follows from efficient Fast Fourier Transform-based evaluation of the required 1D convolutions. We additionally provide numerical experiments that study the performance of the proposed algorithms and compare convergence behavior and quantization. Finally, we prove some theoretical results including well-posedness of the flows and long-time convergence guarantees for the RRW flow.
