mlsanityData to 7 Oct 2026

Differentiable Annealed Importance Sampling and the Perils of Gradient Noise

arXiv 2107.10211 ↗First posted 21 Jul 2021stat.ML cs.LGcited by 36

Not on the map. Why?

Abstract (arXiv)

Annealed importance sampling (AIS) and related algorithms are highly effective tools for marginal likelihood estimation, but are not fully differentiable due to the use of Metropolis-Hastings correction steps. Differentiability is a desirable property as it would admit the possibility of optimizing marginal likelihood as an objective using gradient-based methods. To this end, we propose Differentiable AIS (DAIS), a variant of AIS which ensures differentiability by abandoning the Metropolis-Hastings corrections. As a further advantage, DAIS allows for mini-batch gradients. We provide a detailed convergence analysis for Bayesian linear regression which goes beyond previous analyses by explicitly accounting for the sampler not having reached equilibrium. Using this analysis, we prove that DAIS is consistent in the full-batch setting and provide a sublinear convergence rate. Furthermore, motivated by the problem of learning from large-scale datasets, we study a stochastic variant of DAIS that uses mini-batch gradients. Surprisingly, stochastic DAIS can be arbitrarily bad due to a fundamental incompatibility between the goals of last-iterate convergence to the posterior and elimination of the accumulated stochastic error. This is in stark contrast with other settings such as gradient-based optimization and Langevin dynamics, where the effect of gradient noise can be washed out by taking smaller steps. This indicates that annealing-based marginal likelihood estimation with stochastic gradients may require new ideas.

Key facts. Cited by 36 papers in the map (data through 7 Oct 2026). Builds on 28 of its 53 references that are in the map. First posted on arXiv 21 Jul 2021.

Builds on

28 of 53 references.

References · 28

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2015Importance Weighted Autoencoderscited by 454
  3. 2015Gradient-based Hyperparameter Optimization through Reversible Learningcited by 357
  4. 2014Stochastic Gradient Hamiltonian Monte Carlocited by 341
  5. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  6. 2020Scalable Gradients for Stochastic Differential Equationscited by 264
  7. 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 242
  8. 2014Theoretical guarantees for approximate sampling from smooth and log-concave densitiescited by 206
  9. 2015A Complete Recipe for Stochastic Gradient MCMCcited by 146
  10. 2017Underdamped Langevin MCMC: A non-asymptotic analysiscited by 131
  11. 2019Which Algorithmic Choices Matter at Which Batch Sizes? Insights From a Noisy Quadratic Modelcited by 116
  12. 2017Noisy Natural Gradient as Variational Inferencecited by 94
16 more
  1. 2017Variational Sequential Monte Carlocited by 93
  2. 2017Filtering Variational Objectivescited by 91
  3. 2014Consistency and fluctuations for stochastic gradient Langevin dynamicscited by 65
  4. 2017Auto-Encoding Sequential Monte Carlocited by 64
  5. 2018Hamiltonian Variational Auto-Encodercited by 41
  6. 2016On the Quantitative Analysis of Decoder-Based Generative Modelscited by 40
  7. 2021MCMC Variational Inference via Uncorrected Hamiltonian Annealingcited by 39
  8. 2021Monte Carlo Variational Auto-Encoderscited by 36
  9. 2016On the Convergence of Stochastic Gradient MCMC Algorithms with High-Order Integratorscited by 35
  10. 2020Faster Convergence of Stochastic Gradient Langevin Dynamics for Non-Log-Concave Samplingcited by 32
  11. 2019The Thermodynamic Variational Objectivecited by 26
  12. 2016Reparameterization Gradients through Acceptance-Rejection Sampling Algorithmscited by 22
  13. 2015Sandwiching the marginal likelihood using bidirectional Monte Carlocited by 20
  14. 2021Improving Lossless Compression Rates via Monte Carlo Bits-Back Codingcited by 19
  15. 2020Evaluating Lossy Compression Rates of Deep Generative Modelscited by 16
  16. 2020SUMO: Unbiased Estimation of Log Marginal Probability for Latent Variable Modelscited by 14

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 11; 2023: 8; 2024: 9; 2025: 6; 2026: 1.

36 papers.

Sort:

By area:

  1. 2023Denoising Diffusion Samplerscited by 144
  2. 2022Flow Annealed Importance Sampling Bootstrapcited by 124
  3. 2022Continual Repeated Annealed Flow Transport Monte Carlocited by 66
  4. 2022Bayesian Model Selection, the Marginal Likelihood, and Generalizationcited by 56
  5. 2024Beyond ELBOs: A Large-Scale Evaluation of Variational Methods for Samplingcited by 55
  6. 2022Score-Based Diffusion meets Annealed Importance Samplingcited by 51
  7. 2025Underdamped Diffusion Bridges with Applications to Samplingcited by 28
  8. 2022Langevin Diffusion Variational Inferencecited by 26
  9. 2024Liouville Flow Importance Samplercited by 25
  10. 2025Trust Region Constrained Measure Transport in Path Space for Stochastic Optimal Control and Inferencecited by 22
  11. 2023Transport meets Variational Inference: Controlled Monte Carlo Diffusionscited by 21
  12. 2023Deep Generative Models for Detector Signature Simulation: A Taxonomic Reviewcited by 18
24 more
  1. 2021Surrogate Likelihoods for Variational Annealed Importance Samplingcited by 14
  2. 2022Bayesian inference via sparse Hamiltonian flowscited by 12
  3. 2022Designing Perceptual Puzzles by Differentiating Probabilistic Programscited by 12
  4. 2022MixFlows: principled variational inference via mixed flowscited by 11
  5. 2024Annealing Flow Generative Models Towards Sampling High-Dimensional and Multi-Modal Distributionscited by 11
  6. 2024Provable Convergence and Limitations of Geometric Tempering for Langevin Dynamicscited by 10
  7. 2023Adaptive Annealed Importance Sampling with Constant Rate Progresscited by 7
  8. 2022Markov Chain Score Ascent: A Unifying Framework of Variational Inference with Markovian Gradientscited by 6
  9. 2023Embracing the chaos: analysis and diagnosis of numerical instability in variational flowscited by 6
  10. 2023Differentiating Metropolis-Hastings to Optimize Intractable Densitiescited by 5
  11. 2025Neural Flow Samplers with Shortcut Modelscited by 5
  12. 2022Variational Inference with Locally Enhanced Bounds for Hierarchical Modelscited by 4
  13. 2024Ensemble-Based Annealed Importance Samplingcited by 4
  14. 2025End-To-End Learning of Gaussian Mixture Priors for Diffusion Samplercited by 4
  15. 2024Variational Learning of Gaussian Process Latent Variable Models through Stochastic Gradient Annealed Importance Samplingcited by 3
  16. 2023Resampling Gradients Vanish in Differentiable Sequential Monte Carlo Samplerscited by 2
  17. 2023Reparameterized Variational Rejection Samplingcited by 2
  18. 2024Denoising Diffusion Variational Inference: Diffusion Models as Expressive Variational Posteriorscited by 2
  19. 2024Differentiable Annealed Importance Sampling Minimizes The Symmetrized Kullback-Leibler Divergence Between Initial and Target Distributioncited by 2
  20. 2022Optimization of Annealed Importance Sampling Hyperparameterscited by 1
  21. 2025Asymptotically exact variational flows via involutive MCMC kernelscited by 1
  22. 2025Continuously Tempered Diffusion Samplerscited by 1
  23. 2024MCMC-driven learningcited by 0
  24. 2026Large-scale empirical tuning and comparison of default optimizers for variational inferencecited by 0