mlsanityData to 14 Oct 2026

Sampling by averaging: A multiscale approach to score estimation

arXiv 2508.15069 ↗First posted 20 Aug 2025stat.CO stat.ME stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

We introduce a novel framework for efficient sampling from complex, unnormalised target distributions by exploiting multiscale dynamics. Traditional score-based sampling methods either rely on learned approximations of the score function or involve computationally expensive nested Markov chain Monte Carlo (MCMC) loops. In contrast, the proposed approach leverages stochastic averaging within a slow-fast system of stochastic differential equations (SDEs) to estimate intermediate scores along a diffusion path without training or inner-loop MCMC. Two algorithms are developed under this framework: MultALMC, which uses multiscale annealed Langevin dynamics, and MultCDiff, based on multiscale controlled diffusions for the reverse-time Ornstein-Uhlenbeck process. Both overdamped and underdamped variants are considered, with theoretical guarantees of convergence to the desired diffusion path. The framework is extended to handle heavy-tailed target distributions using Student's t-based noise models and tailored fast-process dynamics. Empirical results across synthetic and real-world benchmarks, including multimodal and high-dimensional distributions, demonstrate that the proposed methods are competitive with existing samplers in terms of accuracy and efficiency, without the need for learned models.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 38 of its 81 references that are in the map. First posted on arXiv 20 Aug 2025.

Builds on

38 of 81 references.

References · 38

  1. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  2. 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,101
  3. 2020Improved Techniques for Training Score-Based Generative Modelscited by 1,043
  4. 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 939
  5. 2022Sampling is as easy as learning the score: theory for diffusion models with minimal data assumptionscited by 445
  6. 2023Nearly d-Linear Convergence Bounds for Diffusion Models via Stochastic Localizationcited by 235
  7. 2021Score-Based Generative Modeling with Critically-Damped Langevin Diffusioncited by 233
  8. 2015Non-asymptotic convergence analysis for the Unadjusted Langevin Algorithmcited by 197
  9. 2021Path Integral Sampler: a stochastic control approach for samplingcited by 181
  10. 2019Flow-based generative models for Markov chain Monte Carlo in lattice field theorycited by 148
  11. 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 133
  12. 2022Flow Annealed Importance Sampling Bootstrapcited by 127
26 more
  1. 2022GENIE: Higher-Order Denoising Diffusion Solverscited by 127
  2. 2023Improved sampling via learned diffusionscited by 104
  3. 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 101
  4. 2020Structured Logconcave Sampling with a Restricted Gaussian Oraclecited by 86
  5. 2022Improved analysis for a proximal algorithm for samplingcited by 73
  6. 2024Particle Denoising Diffusion Samplercited by 65
  7. 2020Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithmcited by 57
  8. 2024Beyond ELBOs: A Large-Scale Evaluation of Variational Methods for Samplingcited by 56
  9. 2024Sequential Controlled Langevin Diffusionscited by 48
  10. 2021Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Samplingcited by 44
  11. 2023Reverse Diffusion Monte Carlocited by 41
  12. 2024Heavy-Tailed Diffusion Modelscited by 40
  13. 2023Towards a Complete Analysis of Langevin Monte Carlo: Beyond Poincar'e Inequalitycited by 31
  14. 2025Underdamped Diffusion Bridges with Applications to Samplingcited by 29
  15. 2024Stochastic Localization via Iterative Posterior Samplingcited by 28
  16. 2024Provable Benefit of Annealed Langevin Monte Carlo for Non-log-concave Samplingcited by 23
  17. 2023On Sampling with Approximate Transport Mapscited by 21
  18. 2024Diffusive Gibbs Samplingcited by 21
  19. 2021Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributionscited by 19
  20. 2024Zeroth-Order Sampling Methods for Non-Log-Concave Distributions: Alleviating Metastability by Denoising Diffusioncited by 19
  21. 2021Mixing Time Guarantees for Unadjusted Hamiltonian Monte Carlocited by 18
  22. 2023Chain of Log-Concave Markov Chainscited by 14
  23. 2025Non-asymptotic Analysis of Diffusion Annealed Langevin Monte Carlo for Generative Modellingcited by 11
  24. 2024Hamiltonian Score Matching and Generative Flowscited by 7
  25. 2024A Practical Diffusion Path for Samplingcited by 5
  26. 2023Mean-Square Analysis of Discretized Ito Diffusions for Heavy-tailed Samplingcited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.