Accelerated Markov Chain Monte Carlo Using Adaptive Weighting Scheme
Yanbo Wang, Wenyu Chen, and Shimin Shan

TL;DR
This paper introduces an adaptive, non-uniform selection scheme for Gibbs sampling in MCMC, improving mixing times by choosing variables based on their marginal probabilities, validated through experiments.
Contribution
It proposes a novel non-uniform, adaptive variable selection method for Gibbs sampling that optimizes the selection probabilities to enhance convergence.
Findings
The non-uniform scan preserves the target distribution.
Optimal selection probabilities can be derived analytically.
Experiments show improved mixing times in real-world applications.
Abstract
Gibbs sampling is one of the most commonly used Markov Chain Monte Carlo (MCMC) algorithms due to its simplicity and efficiency. It cycles through the latent variables, sampling each one from its distribution conditional on the current values of all the other variables. Conventional Gibbs sampling is based on the systematic scan (with a deterministic order of variables). In contrast, in recent years, Gibbs sampling with random scan has shown its advantage in some scenarios. However, almost all the analyses of Gibbs sampling with the random scan are based on uniform selection of variables. In this paper, we focus on a random scan Gibbs sampling method that selects each latent variable non-uniformly. Firstly, we show that this non-uniform scan Gibbs sampling leaves the target posterior distribution invariant. Then we explore how to determine the selection probability for latent variables.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Advanced Statistical Methods and Models
MethodsSparse Evolutionary Training · Focus
