Population Monte Carlo Algorithm in High Dimensions
- 198 Downloads
The population Monte Carlo algorithm is an iterative importance sampling scheme for solving static problems. We examine the population Monte Carlo algorithm in a simplified setting, a single step of the general algorithm, and study a fundamental problem that occurs in applying importance sampling to high-dimensional problem. The precision of the computed estimate from the simplified setting is measured by the asymptotic variance of estimate under conditions on the importance function. We demonstrate the exponential growth of the asymptotic variance with the dimension and show that the optimal covariance matrix for the importance function can be estimated in special cases.
KeywordsAsymptotic variance of estimate Central limit theorem Importance sampling Markov chain Monte Carlo Population Monte Carlo
AMS 2000 Subject Classifications65C05 65C60
Unable to display preview. Download preview PDF.
- Douc R, Guillin A, Marin J-M, Robert CP (2007a) Convergence of adaptive sampling schemes. Ann Stat 35(1)Google Scholar
- Gelman A, Carlin J B, Ster HS, Rubin DB (1995) Bayesian data analysis. Chapman & Hall, LondonGoogle Scholar
- Goldon N, Salmon D, Smith A (1993) Novel approach to nonlinear/non-Gaussian Bayesian state estimation. IEEE Proc-F 140(2):107–113Google Scholar
- Li B, Bengtsson T, Bickel P (2005) Curse-of-dimensionality revisited: collapse of importance sampling in very large scale systems. Technical report 696, Department of Statistics, UC-BerkeleyGoogle Scholar
- Roberts GO, Rosenthal J (2006) Examples of adaptive MCMC. Technical report, Lancaster UniversityGoogle Scholar