Please use this identifier to cite or link to this item:
|Title:||Dynamically weighted importance sampling in Monte Carlo computation|
Markov chain Monte Carlo
Sequential importance sampling
|Citation:||Liang, F. (2002-09). Dynamically weighted importance sampling in Monte Carlo computation. Journal of the American Statistical Association 97 (459) : 807-821. ScholarBank@NUS Repository. https://doi.org/10.1198/016214502388618618|
|Abstract:||This article describes a new Monte Carlo algorithm, dynamically weighted importance sampling (DWIS), for simulation and optimization. In DWIS, the state of the Markov chain is augmented to a population. At each iteration, the population is subject to two move steps, dynamic weighting and population control. These steps ensure that DWIS can move across energy barriers like dynamic weighting, but with the weights well controlled and with a finite expectation. The estimates can converge much faster than they can with dynamic weighting. A generalized theory for importance sampling is introduced to justify the new algorithm. Numerical examples are given to show that dynamically weighted importance sampling can perform significantly better than the Metropolis-Hastings algorithm and dynamic weighting in some situations.|
|Source Title:||Journal of the American Statistical Association|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 19, 2018
WEB OF SCIENCETM
checked on Jun 12, 2018
checked on Jun 22, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.