The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Annealed importance sampling
Abstract
Simulated annealing—moving from a tractable distribution to a distribution of interest via a sequence of intermediate distributions—has traditionally been used as an inexact method of handling isolated modes in Markov chain samplers. Here, it is shown how one can use the Markov chain transitions for such an annealing sequence to define an importance sampler. The Markov chain aspect allows this method to perform acceptably even for high-dimensional problems, where finding good importance sampling distributions would otherwise be very difficult, while the use of importance weights ensures that the estimates found converge to the correct values as the number of annealing runs increases. This annealed importance sampling procedure resembles the second half of the previously-studied tempered transitions, and can be seen as a generalization of a recently-proposed variant of sequential importance sampling. It is also related to thermodynamic integration methods for estimating ratios of normalizing constants. Annealed importance sampling is most attractive when isolated modes are present, or when estimates of normalizing constants are required, but it may also be more generally useful, since its independent sampling allows one to bypass some of the problems of assessing convergence and autocorrelation in Markov chain samplers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 1×
“An alternative is to obtain a sample of dependent points by simulating a Markov chain that converges to the distribution of interest, as in the Metropolis-Hastings algorithm (Metropolis, et al 1953; Hastings 1970).”
MethodMarkov Chain Monte Carlo in Practice
(1995) · Chapman & Hall/CRC eBooks · doi:10.1201/b14835 · Cited by 7,757
Nonphysical sampling distributions in Monte Carlo free-energy estimation: Umbrella sampling
Torrie, G. M., & Valleau, J. P. (1977) · Journal of Computational Physics · doi:10.1016/0021-9991(77)90121-8 · Cited by 6,091
Nonequilibrium Equality for Free Energy Differences
Jarzynski, C. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.2690 · Cited by 5,293
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
Self-citationRipley, B. D. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316726 · Cited by 2,241
Simulated Tempering: A New Monte Carlo Scheme
Marinari, E., & Parisi, G. (1992) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/19/6/002 · Cited by 1,818
Bayesian Inference in Econometric Models Using Monte Carlo Integration
Geweke, J. (1989) · Econometrica · doi:10.2307/1913710 · Cited by 1,563
Cited by
(2017) · International Conference on Machine Learning · Cited by 6,382
Rue, H., Martino, S., & Chopin, N. (2009) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2008.00700.x · Cited by 5,279
Cosmological parameters from CMB and other data: A Monte Carlo approach
Lewis, A., & Bridle, S. (2002) · Physical Review D · doi:10.1103/physrevd.66.103511 · Cited by 3,495
Deep Unsupervised Learning using Nonequilibrium Thermodynamics
Sohl-Dickstein, J., Weiss, E. A., Maheswaranathan, N., & Ganguli, S. (2015) · arXiv · doi:10.48550/arxiv.1503.03585 · Cited by 2,637
MCMC Using Hamiltonian Dynamics
Neal, R. M. (2011) · Handbook of Markov Chain Monte Carlo · doi:10.1201/b10905-6 · Cited by 2,574
Self-citationParticle Markov Chain Monte Carlo Methods
Andrieu, C., Doucet, A., & Holenstein, R. (2010) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2009.00736.x · Cited by 1,971
(2003) · Cited by 1,680
Riemann manifold langevin and hamiltonian monte carlo methods
Girolami, M., & Calderhead, B. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00765.x · Cited by 1,473
Generative Modeling by Estimating Gradients of the Data Distribution
Song, Y., & Ermon, S. (2019) · arXiv · doi:10.48550/arxiv.1907.05600 · Cited by 1,453
Neal, R. M. (2003) · The Annals of Statistics · doi:10.1214/aos/1056562461 · Cited by 1,361
Self-citationSequential Monte Carlo Samplers
Del Moral, P., Doucet, A., & Jasra, A. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2006.00553.x · Cited by 1,239
Huber, M. (2011) · Handbook of Markov Chain Monte Carlo · doi:10.1201/b10905-10 · Cited by 1,176
Sigal, L., Balan, A. O., & Black, M. J. (2010) · International Journal of Computer Vision · doi:10.1007/s11263-009-0273-6 · Cited by 1,164
An Overview of Existing Methods and Recent Advances in Sequential Monte Carlo
Cappe, O., Godsill, S. J., & Moulines, E. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.893250 · Cited by 1,009
Pros and cons of GAN evaluation measures
Borji, A. (2019) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2018.10.009 · Cited by 963
A high-bias, low-variance introduction to Machine Learning for physicists
Mehta, P., Bukov, M., Wang, C.-H., Day, A. G. R., Richardson, C., Fisher, C. K., & Schwab, D. J. (2019) · Physics Reports · doi:10.1016/j.physrep.2019.03.001 · Cited by 920
Evaluation methods for topic models
Wallach, H. M., Murray, I., Salakhutdinov, R., & Mimno, D. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553515 · Cited by 863
Sequential Monte Carlo without likelihoods
Sisson, S. A., Fan, Y., & Tanaka, M. M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0607208104 · Cited by 856
A survey of appearance models in visual object tracking
Li, X., Hu, W., Shen, C., Zhang, Z., Dick, A., & Hengel, A. V. D. (2013) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2508037.2508039 · Cited by 705
Criminisi, A. (2011) · now publishers, Inc. eBooks · doi:10.1561/9781601985415 · Cited by 703
Comparing families of dynamic causal models
Penny, W. D., Stephan, K. E., Daunizeau, J., Rosa, M. J., Friston, K. J., Schofield, T. M., & Leff, A. P. (2010) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000709 · Cited by 688
Criminisi, A., Shotton, J., & Konukoglu, E. (2012) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000035 · Cited by 677
“Recent, Monte Carlo-based techniques for approximating the partition function are also a possibility [72, 94].”
BackgroundStatistically optimal perception and learning: from behavior to neural representations
Fiser, J., Berkes, P., Orbán, G., & Lengyel, M. (2010) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2010.01.003 · Cited by 672
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
An adaptive sequential Monte Carlo method for approximate Bayesian computation
Del Moral, P., Doucet, A., & Jasra, A. (2012) · Statistics and Computing · doi:10.1007/s11222-011-9271-y · Cited by 505
Training restricted Boltzmann machines: An introduction
Fischer, A., & Igel, C. (2014) · Pattern Recognition · doi:10.1016/j.patcog.2013.05.025 · Cited by 504
An Efficient Learning Procedure for Deep Boltzmann Machines
Salakhutdinov, R., & Hinton, G. (2012) · Neural Computation · doi:10.1162/neco_a_00311 · Cited by 484
Beal, M. J., & Ghahramani, Z. (2003) · Bayesian Statistics 7 · doi:10.1093/oso/9780198526155.003.0025 · Cited by 458
Learning Deep Generative Models
Salakhutdinov, R. (2015) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-010814-020120 · Cited by 436
Articulated Body Motion Capture by Stochastic Search
Deutscher, J., & Reid, I. (2005) · International Journal of Computer Vision · doi:10.1023/b:visi.0000043757.18370.9c · Cited by 412
On the quantitative analysis of deep belief networks
Salakhutdinov, R., & Murray, I. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390266 · Cited by 411
Tokdar, S. T., & Kass, R. E. (2010) · WIREs Computational Statistics · doi:10.1002/wics.56 · Cited by 369
Marginal Likelihood Estimation via Power Posteriors
Friel, N., & Pettitt, A. N. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2007.00650.x · Cited by 353
SMC2: An Efficient Algorithm for Sequential Analysis of State Space Models
Chopin, N., Jacob, P. E., & Papaspiliopoulos, O. (2013) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2012.01046.x · Cited by 338
Rare events and the convergence of exponentially averaged work values
Jarzynski, C. (2006) · Physical Review E · doi:10.1103/physreve.73.046105 · Cited by 326
A Survey of Sequential Monte Carlo Methods for Economics and Finance
Creal, D. (2012) · Econometric Reviews · doi:10.1080/07474938.2011.607333 · Cited by 301
Gronau, Q. F., Sarafoglou, A., Matzke, D., Ly, A., Boehm, U., Marsman, M., Leslie, D. S., Forster, J. J., Wagenmakers, E.-J., & Steingroever, H. (2017) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2017.09.005 · Cited by 284
MCMC for doubly-intractable distributions
Murray, I., Ghahramani, Z., & Mackay, D. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.6848 · Cited by 281
Associating neural word embeddings with deep image representations using Fisher Vectors
Klein, B., Lev, G., Sadeh, G., & Wolf, L. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7299073 · Cited by 281
Sequential importance sampling for structural reliability analysis
Papaioannou, I., Papadimitriou, C., & Straub, D. (2016) · Structural Safety · doi:10.1016/j.strusafe.2016.06.002 · Cited by 266
Fight sample degeneracy and impoverishment in particle filters: A review of intelligent approaches
Li, T., Sun, S., Sattar, T. P., & Corchado, J. M. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.12.031 · Cited by 257
Bayesian ranking of biochemical system models
Vyshemirsky, V., & Girolami, M. A. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btm607 · Cited by 181
Information Perspective to Probabilistic Modeling: Boltzmann Machines versus Born Machines
Cheng, S., Chen, J., & Wang, L. (2018) · Entropy · doi:10.3390/e20080583 · Cited by 104
(2010) · Cited by 94
Non-Reversible Parallel Tempering: A Scalable Highly Parallel MCMC Scheme
Syed, S., Bouchard-Côté, A., Deligiannidis, G., & Doucet, A. (2022) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12464 · Cited by 68
The Shape Boltzmann Machine: A strong model of object shape
Eslami, S. M. A., Heess, N., & Winn, J. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247702 · Cited by 61
Designing molecular RNA switches with Restricted Boltzmann machines
Fernandez-de-Cossio-Diaz, J., Hardouin, P., Lyonnet du Moutier, F.-X., Di Gioacchino, A., Marchand, B., Ponty, Y., Sargueil, B., Monasson, R., & Cocco, S. (2025) · Nature Communications · doi:10.1038/s41467-025-66265-y · Cited by 20
Metadata
- Authors
- Neal, R. M.
- Venue
- Statistics and Computing
- Published
- 2001-04
- Volume
- 11
- Issue
- 2
- Pages
- 125-139
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W1513873506
- Cited by
- 1,172
- References
- 18
- FWCI
- 7.78
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.