Unbalanced Sobolev Descent
Not on the map. Why?
Abstract (arXiv)
We introduce Unbalanced Sobolev Descent (USD), a particle descent algorithm for transporting a high dimensional source distribution to a target distribution that does not necessarily have the same mass. We define the Sobolev-Fisher discrepancy between distributions and show that it relates to advection-reaction transport equations and the Wasserstein-Fisher-Rao metric between distributions. USD transports particles along gradient flows of the witness function of the Sobolev-Fisher discrepancy (advection step) and reweighs the mass of particles with respect to this witness function (reaction step). The reaction step can be thought of as a birth-death process of the particles with rate of growth proportional to the witness function. When the Sobolev-Fisher witness function is estimated in a Reproducing Kernel Hilbert Space (RKHS), under mild assumptions we show that USD converges asymptotically (in the limit of infinite particles) to the target distribution in the Maximum Mean Discrepancy (MMD) sense. We then give two methods to estimate the Sobolev-Fisher witness with neural networks, resulting in two Neural USD algorithms. The first one implements the reaction step with mirror descent on the weights, while the second implements it through a birth-death process of particles. We show on synthetic examples that USD transports distributions with or without conservation of mass faster than previous particle descent algorithms, and finally demonstrate its use for molecular biology analyses where our method is naturally suited to match developmental stages of populations of differentiating cells based on their single-cell RNA sequencing profile. Code is available at https://github.com/ibm/usd .
Key facts. Cited by 11 papers in the map (data through 13 Oct 2026). First posted on arXiv 29 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 0; 2023: 4; 2024: 2; 2025: 1; 2026: 1.
11 papers.
- 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networkscited by 53
- 2021KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint Supportcited by 37
- 2023GenPhys: From Physical Processes to Generative Modelscited by 19
- 2023GAD-PVI: A General Accelerated Dynamic-Weight Particle-Based Variational Inference Frameworkcited by 9
- 2024Neural Sinkhorn Gradient Flowcited by 8
- 2021DPVI: A Dynamic-Weight Particle-Based Variational Inference Frameworkcited by 7
- 2024Inclusive KL Gradient Flows: Otto-Wasserstein, Fisher-Rao-Gaussian, and Local-Estimator Dynamicscited by 4
- 2026Sobolev Regularized MMD Gradient Flowcited by 3
- 2023Data Interpolants -- That's What Discriminators in Higher-order Gradient-regularized GANs Arecited by 2
- 2025Scalable Sobolev IPM for Probability Measures on a Graphcited by 1
- 2023Insights into Closed-form IPM-GAN Discriminator Guidance for Diffusion Modelingcited by 0
- 2026Sobolev Regularized MMD Gradient Flow12 May 2026
- 2025Scalable Sobolev IPM for Probability Measures on a Graph2 Feb 2025
- 2024Inclusive KL Gradient Flows: Otto-Wasserstein, Fisher-Rao-Gaussian, and Local-Estimator Dynamics31 Oct 2024
- 2024Neural Sinkhorn Gradient Flow25 Jan 2024
- 2023GAD-PVI: A General Accelerated Dynamic-Weight Particle-Based Variational Inference Framework27 Dec 2023
- 2023Insights into Closed-form IPM-GAN Discriminator Guidance for Diffusion Modeling2 Jun 2023
- 2023Data Interpolants -- That's What Discriminators in Higher-order Gradient-regularized GANs Are1 Jun 2023
- 2023GenPhys: From Physical Processes to Generative Models5 Apr 2023
- 2021DPVI: A Dynamic-Weight Particle-Based Variational Inference Framework2 Dec 2021
- 2021KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint Support16 Jun 2021
- 2021Optimizing Functionals on the Space of Probabilities with Input Convex Neural Networks1 Jun 2021