mlsanityData to 7 Oct 2026

Sampling Multimodal Distributions with the Vanilla Score: Benefits of Data-Based Initialization

arXiv 2310.01762 ↗First posted 3 Oct 2023cs.LG cs.DS math.STcited by 10

Not on the map. Why?

Abstract (arXiv)

There is a long history, as well as a recent explosion of interest, in statistical and generative modeling approaches based on score functions -- derivatives of the log-likelihood of a distribution. In seminal works, Hyv"arinen proposed vanilla score matching as a way to learn distributions from data by computing an estimate of the score function of the underlying ground truth, and established connections between this method and established techniques like Contrastive Divergence and Pseudolikelihood estimation. It is by now well-known that vanilla score matching has significant difficulties learning multimodal distributions. Although there are various ways to overcome this difficulty, the following question has remained unanswered -- is there a natural way to sample multimodal distributions using just the vanilla score? Inspired by a long line of related experimental works, we prove that the Langevin diffusion with early stopping, initialized at the empirical distribution, and run on a score function estimated from data successfully generates natural multimodal distributions (mixtures of log-concave distributions).

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 24 of its 46 references that are in the map. First posted on arXiv 3 Oct 2023.

Builds on

24 of 46 references.

References · 24

  1. 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,694
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
  3. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
  4. 2017Renyi Differential Privacycited by 643
  5. 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 440
  6. 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 381
  7. 2019Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Sufficescited by 224
  8. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 206
  9. 2022Convergence of score-based generative modeling for general data distributionscited by 179
  10. 2022Convergence for score-based generative modeling with polynomial complexitycited by 176
  11. 2016A Theory of Generative ConvNetcited by 174
  12. 2019Learning Non-Convergent Non-Persistent Short-Run MCMC Toward Energy-Based Modelcited by 147
12 more
  1. 2020Generative Modeling with Denoising Auto-Encoders and Langevin Samplingcited by 118
  2. 2019On the Anatomy of MCMC-Based Maximum Likelihood Learning of Energy-Based Modelscited by 105
  3. 2022Statistical Efficiency of Score Matching: The View from Isoperimetrycited by 63
  4. 2019Minimum Stein Discrepancy Estimatorscited by 57
  5. 2013Density Estimation in Infinite Dimensional Exponential Familiescited by 41
  6. 2018Learning deep kernels for exponential family densitiescited by 36
  7. 2018Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structurecited by 35
  8. 2021Introduction to Normalizing Flows for Lattice Field Theorycited by 35
  9. 2017Beyond Log-concavity: Provable Guarantees for Sampling Multi-modal Distributions using Simulated Tempering Langevin Monte Carlocited by 33
  10. 2017Learning Energy-Based Models as Generative ConvNets via Multi-grid Modeling and Samplingcited by 32
  11. 2018Simulated Tempering Langevin Monte Carlo II: An Improved Proof using Soft Markov Chain Decompositioncited by 16
  12. 2018Local Optimality and Generalization Guarantees for the Langevin Algorithm via Empirical Metastabilitycited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 5; 2025: 4; 2026: 1.

10 papers.