Generalized darting Monte Carlo
نویسندگان
چکیده
One of the main shortcomings of Markov chain Monte Carlo samplers is their inability to mix between modes of the target distribution. In this paper we show that advance knowledge of the location of these modes can be incorporated into the MCMC sampler by introducing mode-hopping moves that satisfy detailed balance. The proposed sampling algorithm explores local mode structure through local MCMC moves (e.g . diffusion or Hybrid Monte Carlo) but in addition also represents the relative strengths of the different modes correctly using a set of global moves. This ‘mode-hopping’ MCMC sampler can be viewed as a generalization of the darting method [1]. We illustrate the method on learning Markov random fields and evaluate it against the spherical darting algorithm on a ‘real world’ vision application of inferring 3-D human body pose distributions from 2-D image information.
منابع مشابه
Smart Darting Monte Carlo
The ‘‘Smart Walking’’ Monte Carlo algorithm is examined. In general, due to a bias imposed by the interbasin trial move, the algorithm does not satisfy detailed balance. While it has been shown that it can provide good estimates of equilibrium averages for certain potentials, for other potentials the estimates are poor. A modified version of the algorithm, Smart Darting Monte Carlo, which obeys...
متن کاملDistributed and Adaptive Darting Monte Carlo through Regenerations
Darting Monte Carlo (DMC) is a MCMC procedure designed to effectively mix between multiple modes of a probability distribution. We propose an adaptive and distributed version of this method by using regenerations. This allows us to run multiple chains in parallel and adapt the shape of the jump regions as well as all other aspects of the Markov chain on the fly. We show that this significantly ...
متن کاملA Mode-Hopping MCMC sampler
One of the main shortcomings of Markov chain Monte Carlo samplers is their inability to mix between modes of the target distribution. In this paper we show that advance knowledge of the location of these modes can be incorporated into the MCMC sampler by introducing mode-hopping moves that satisfy detailed balance. The proposed sampling algorithm explores local mode structure through local MCMC...
متن کاملCool walking: A new Markov chain Monte Carlo sampling method
Effective relaxation processes for difficult systems like proteins or spin glasses require special simulation techniques that permit barrier crossing to ensure ergodic sampling. Numerous adaptations of the venerable Metropolis Monte Carlo (MMC) algorithm have been proposed to improve its sampling efficiency, including various hybrid Monte Carlo (HMC) schemes, and methods designed specifically f...
متن کاملCombining smart darting with parallel tempering using Eckart space: application to Lennard-Jones clusters.
The smart-darting algorithm is a Monte Carlo based simulation method used to overcome quasiergodicity problems associated with disconnected regions of configurations space separated by high energy barriers. As originally implemented, the smart-darting method works well for clusters at low temperatures with the angular momentum restricted to zero and where there are no transitions to permutation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 44 شماره
صفحات -
تاریخ انتشار 2007