Unbalanced Sobolev Descent
Youssef Mroueh, Mattia Rigotti
Abstract
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 birthdeath 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 http://github.com/ibm/usd .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b721aeff-72e3-4505-bce7-b34136b3475eCited by top-tier papers5
- KALE Flow: A Relaxed KL Gradient Flow for Probabilities with Disjoint SupportPierre Glaser, Michael Arbel, Arthur GrettonNeurIPS 2021 · 49 citations
- Gradual Domain Adaptation via Gradient FlowZhan Zhuang, Yu Zhang, Ying WeiICLR 2024 · 15 citations
- GAD-PVI: A General Accelerated Dynamic-Weight Particle-Based Variational Inference FrameworkFangyikang Wang, Huminhao Zhu, Chao Zhang, Hanbin Zhao et al.AAAI 2024 · 14 citations
- Interaction-Force Transport Gradient FlowsEgor Gladin, Pavel E. Dvurechenskii, Alexander Mielke, Jia-Jie ZhuNeurIPS 2024 · 7 citations
- A Unifying View of Variational Generative Wasserstein FlowsPaul Caucheteux, Clément Bonet, Anna KorbaICML 2026 · 2 citations
Related papers
- WFR-FM: Simulation-Free Dynamic Unbalanced Optimal TransportQiangwei Peng, Zihan Wang, Junda Ying, Yuhao Sun et al.ICLR 2026 · 8 citations
- WFR-MFM: One-Step Inference for Dynamic Unbalanced Optimal TransportXinyu Wang, Ruoyu Wang, Qiangwei Peng, Peijie Zhou et al.ICML 2026 · 3 citations
- Neural Wasserstein Gradient Flows for Discrepancies with Riesz KernelsFabian Altekrüger, Johannes Hertrich, Gabriele SteidlICML 2023 · 15 citations
- Mirror and Preconditioned Gradient Descent in Wasserstein SpaceClément Bonet, Théo Uscidda, Adam David, Pierre-Cyril Aubin-Frankowski et al.NeurIPS 2024 · 19 citations
- Variational Regularized Unbalanced Optimal Transport: Single Network, Least ActionYuhao Sun, Zhenyi Zhang, Zihan Wang, Tiejun Li et al.NeurIPS 2025 · 14 citations
