mlsanityData to 7 Oct 2026

A blob method for inhomogeneous diffusion with applications to multi-agent control and sampling

arXiv 2202.12927 ↗First posted 25 Feb 2022math.AP cs.LG cs.NAcited by 6

Not on the map. Why?

Abstract (arXiv)

As a counterpoint to classical stochastic particle methods for linear diffusion equations, we develop a deterministic particle method for the weighted porous medium equation (WPME) and prove its convergence on bounded time intervals. This generalizes related work on blob methods for unweighted porous medium equations. From a numerical analysis perspective, our method has several advantages: it is meshfree, preserves the gradient flow structure of the underlying PDE, converges in arbitrary dimension, and captures the correct asymptotic behavior in simulations. That our method succeeds in capturing the long time behavior of WPME is significant from the perspective of related problems in quantization. Just as the Fokker-Planck equation provides a way to quantize a probability measure barρ by evolving an empirical measure according to stochastic Langevin dynamics so that the empirical measure flows toward barρ, our particle method provides a way to quantize barρ according to deterministic particle dynamics approximating WMPE. In this way, our method has natural applications to multi-agent coverage algorithms and sampling probability measures. A specific case of our method corresponds exactly to confined mean-field dynamics of training a two-layer neural network for a radial basis function activation function. From this perspective, our convergence result shows that, in the overparametrized regime and as the variance of the radial basis functions goes to zero, the continuum limit is given by WPME. This generalizes previous results, which considered the case of a uniform data distribution, to the more general inhomogeneous setting. As a consequence of our convergence result, we identify conditions on the target function and data distribution for which convexity of the energy landscape emerges in the continuum limit.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 18 of its 86 references that are in the map. First posted on arXiv 25 Feb 2022.

Builds on

18 of 86 references.

References · 18

  1. 2016Stein Variational Gradient Descent: A General Purpose Bayesian Inference Algorithmcited by 498
  2. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  3. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
  4. 2017Stein Variational Gradient Descent as Gradient Flowcited by 149
  5. 2018Trainability and Accuracy of Neural Networks: An Interacting Particle System Approachcited by 105
  6. 2020SVGD as a kernelized Wasserstein gradient flow of the chi-squared divergencecited by 64
  7. 2020A Non-Asymptotic Analysis for Stein Variational Gradient Descentcited by 61
  8. 2019Machine Learning from a Continuous Viewpointcited by 50
  9. 2020On the Convergence of Gradient Descent Training for Two-layer ReLU-networks in the Mean Field Regimecited by 38
  10. 2018Scaling limit of the Stein variational gradient descent: the mean field regimecited by 35
  11. 2019Analysis of a Two-Layer Neural Network via Displacement Convexitycited by 27
  12. 2021An Introduction to Hamiltonian Monte Carlo Method for Samplingcited by 8
6 more
  1. 2017Velocity Field Generation for Density Control of Swarms using Heat Equation and Smoothing Kernelscited by 5
  2. 2016Coverage and Field Estimation on Bounded Domains by Diffusive Swarmscited by 1
  3. 2017A gradient flow perspective on the quantization problemcited by 1
  4. 2018Quantitative Assessment of Robotic Swarm Coveragecited by 1
  5. 2019Quantifying Robotic Swarm Coveragecited by 1
  6. 2020Asymptotic optimality of the triangular lattice for a class of optimal location problemscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 4; 2025: 0; 2026: 1.

6 papers.