Radon--Wasserstein Gradient Flows for Interacting-Particle Sampling in High Dimensions
Elias Hess-Childs, Dejan Slep\v{c}ev, Lantian Xu

TL;DR
This paper introduces Radon--Wasserstein gradient flows for high-dimensional particle sampling, enabling efficient, scalable algorithms with theoretical convergence guarantees, leveraging new geometries based on the Radon transform.
Contribution
The paper develops novel Radon--Wasserstein gradient flows that allow accurate high-dimensional particle approximation with linear per-step cost, combining transportation geometry and Radon transform techniques.
Findings
Algorithms scale linearly with dimension and particle number.
Numerical experiments demonstrate effective convergence and quantization.
Theoretical results establish well-posedness and long-term convergence of the flows.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Geometric Analysis and Curvature Flows · Markov Chains and Monte Carlo Methods
