paper-with-me

홈 › Papers

Unbalanced Sobolev Descent

2020-09-29 · NeurIPS 2020 12 · Youssef Mroueh, Mattia Rigotti

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 .

📄 PDF Abstract BibTeX arXiv:2009.14148

Code (1)

IBM/USD 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Scalable Unbalanced Sobolev Transport for Measures on a Graph

2023-02-24 · Tam Le, Truyen Nguyen, Kenji Fukumizu

Optimal transport (OT) is a popular and powerful tool for comparing probability measures. However, OT suffers a few drawbacks: (i) input measures required to have the same mass, (ii) a high computational complexity, and …

MSINO: Curvature-Aware Sobolev Optimization for Manifold Neural Networks

2026-02-26 · Suresan Pareth arxiv

We introduce Manifold Sobolev Informed Neural Optimization (MSINO), a curvature aware training framework for neural networks defined on Riemannian manifolds. The method replaces standard Euclidean derivative supervision …

Sobolev Acceleration and Statistical Optimality for Learning Elliptic Equations via Gradient Descent

2022-05-15 · Yiping Lu, Jose Blanchet, Lexing Ying

In this paper, we study the statistical limits in terms of Sobolev norms of gradient descent for solving inverse problem from randomly sampled noisy observations using a general class of objective functions. Our class of…

Sobolev Descent

2018-05-30 · Youssef Mroueh, Tom Sercu, Anant Raj

We study a simplification of GAN training: the problem of transporting particles from a source to a target distribution. Starting from the Sobolev GAN critic, part of the gradient regularized GAN family, we show a strong…

Random Smoothing Regularization in Kernel Gradient Descent Learning

2023-05-05 · Liang Ding, Tianyang Hu, Jiahang Jiang, Donghao Li 외

Random smoothing data augmentation is a unique form of regularization that can prevent overfitting by introducing noise to the input data, encouraging the model to learn more generalized features. Despite its success in …

Data Augmentation