paper-with-me

홈 › Papers

Cyclical Kernel Adaptive Metropolis

2022-06-29 · Jianan Canal Li, Yimeng Zeng, Wentao Guo

We propose cKAM, cyclical Kernel Adaptive Metropolis, which incorporates a cyclical stepsize scheme to allow control for exploration and sampling. We show that on a crafted bimodal distribution, existing Adaptive Metropolis type algorithms would fail to converge to the true posterior distribution. We point out that this is because adaptive samplers estimates the local/global covariance structure using past history of the chain, which will lead to adaptive algorithms be trapped in a local mode. We demonstrate that cKAM encourages exploration of the posterior distribution and allows the sampler to escape from a local mode, while maintaining the high performance of adaptive methods.

📄 PDF Abstract BibTeX arXiv:2206.14421

Code (1)

canallee/cKAM 공식 구현

Similar Papers 제목 키워드 기반

Kernel Adaptive Metropolis-Hastings

2013-07-19 · Dino Sejdinovic, Heiko Strathmann, Maria Lomeli Garcia, Christophe Andrieu 외

A Kernel Adaptive Metropolis-Hastings algorithm is introduced, for the purpose of sampling from a target distribution with strongly nonlinear support. The algorithm embeds the trajectory of the Markov chain into a reprod…

Reinforcement Learning for Adaptive MCMC

2024-05-22 · Congye Wang, Wilson Chen, Heishiro Kanagawa, Chris. J. Oates

An informal observation, made by several authors, is that the adaptive design of a Markov transition kernel has the flavour of a reinforcement learning task. Yet, to-date it has remained unclear how to actually exploit m…

reinforcement-learningReinforcement Learning

On Cyclical MCMC Sampling

2024-03-01 · LiWei Wang, Xinru Liu, Aaron Smith, Yves Atchade

Cyclical MCMC is a novel MCMC framework recently proposed by Zhang et al. (2019) to address the challenge posed by high-dimensional multimodal posterior distributions like those arising in deep learning. The algorithm wo…

Spectral gap of Metropolis-within-Gibbs under log-concavity

2025-09-30 · Cecilia Secchi, Giacomo Zanella arxiv

The Metropolis-within-Gibbs (MwG) algorithm is a widely used Markov Chain Monte Carlo method for sampling from high-dimensional distributions when exact conditional sampling is intractable. We study MwG with Random Walk …

Variational MCMC

2013-01-10 · Nando de Freitas, Pedro Hojen-Sorensen, Michael. I. Jordan, Stuart Russell

We propose a new class of learning algorithms that combines variational approximation and Markov chain Monte Carlo (MCMC) simulation. Naive algorithms that use the variational approximation as proposal distribution can p…

parameter estimation