Examples comparing importance sampling and the Metropolis algorithm
Federico Bassetti, Persi Diaconis
Abstract
Open-access reader
Federico Bassetti, Persi Diaconis
Abstract
Open-access reader
Importance sampling, particularly sequential and adaptive importance sampling, have emerged as competitive simulation techniques to Markov-chain Monte-Carlo techniques. We compare importance sampling and the Metropolis algorithm as two ways of changing the output of a Markov chain to get a different stationary distribution.
OpenAlex reports 24 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Importance sampling, particularly sequential and adaptive importance sampling, have emerged as competitive simulation techniques to Markov-chain Monte-Carlo techniques. We compare importance sampling and the Metropolis algorithm as two ways of changing the output of a Markov chain to get a different stationary distribution.
Key concepts: Metropolis–Hastings algorithm, Markov chain Monte Carlo, Rejection sampling, Markov chain, Sampling (signal processing), Slice sampling, Mathematics, Algorithm