A quasi-Monte Carlo Metropolis algorithm.
نویسندگان
چکیده
This work presents a version of the Metropolis-Hastings algorithm using quasi-Monte Carlo inputs. We prove that the method yields consistent estimates in some problems with finite state spaces and completely uniformly distributed inputs. In some numerical examples, the proposed method is much more accurate than ordinary Metropolis-Hastings sampling.
منابع مشابه
An Adaptive Quasi Monte Carlo Alternative to Metropolis
We present a manually-adaptive extension of Quasi Monte Carlo (QMC) integration for approximating marginal densities, moments, and quantiles when the joint density is known up to a normalization constant. Randomization and a batch-wise approach involving (0; s)-sequences are the cornerstones of the technique. By incorporating a variety of graphical diagnostics the method allows the user to adap...
متن کاملDiscrepancy estimates for variance bounding Markov chain quasi-Monte Carlo
Markov chain Monte Carlo (MCMC) simulations are modeled as driven by true random numbers. We consider variance bounding Markov chains driven by a deterministic sequence of numbers. The star-discrepancy provides a measure of efficiency of such Markov chain quasi-Monte Carlo methods. We define a pull-back discrepancy of the driver sequence and state a close relation to the star-discrepancy of the...
متن کاملAcceleration of the Multiple-Try Metropolis algorithm using antithetic and stratified sampling
The Multiple-Try Metropolis is a recent extension of the Metropolis algorithm in which the next state of the chain is selected among a set of proposals. We propose a modification of the Multiple-Try Metropolis algorithm which allows for the use of correlated proposals, particularly antithetic and stratified proposals. The method is particularly useful for random walk Metropolis in high dimensio...
متن کاملIntroduction to Monte Carlo methods
These lectures given to graduate students in high energy physics, provide an introduction to Monte Carlo methods. After an overview of classical numerical quadrature rules, Monte Carlo integration together with variance-reducing techniques is introduced. A short description on the generation of pseudo-random numbers and quasi-random numbers is given. Finally, methods to generate samples accordi...
متن کاملExploring quasi Monte Carlo for marginal density approximation
We ®rst review quasi Monte Carlo (QMC) integration for approximating integrals, which we believe is a useful tool often overlooked by statistics researchers. We then present a manuallyadaptive extension of QMC for approximating marginal densities when the joint density is known up to a normalization constant. Randomization and a batch-wise approach involving 0; s-sequences are the cornerstone...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 102 25 شماره
صفحات -
تاریخ انتشار 2005