Solidarity of Spectral Gaps for Component-Wise Markov Chains
Youngwoo Kwon, Galin Jones, Qian Qin

TL;DR
This paper establishes a principle linking the spectral gaps of component-wise Markov chains, showing they are either both positive or both zero under certain conditions, with implications for algorithms like Gibbs samplers and MALA.
Contribution
It introduces a block-wise contraction condition that unifies the convergence rate analysis of deterministic and random-scan Markov chains, including applications to Gaussian targets.
Findings
Spectral gaps of different scan strategies are either both positive or both zero.
Spectral gaps differ at most by polynomial factors in the number of blocks.
Polynomial bounds on spectral gaps for Gaussian target MALA algorithms.
Abstract
Deterministic-scan and random-scan component-wise Markov chain Monte Carlo algorithms, such as Gibbs samplers and conditional Metropolis-Hastings, are popular approaches for sampling from multivariate distributions. A long-standing open question is to determine the conditions under which these algorithms have similar convergence rates. A block-wise contraction condition for the component-wise updates is used to establish a solidarity principle for the spectral gaps of the associated Markov chains. Specifically, under this condition, the spectral gaps of the random-scan and deterministic-scan versions of the Gibbs and component-wise chains are either simultaneously positive or simultaneously zero. Moreover, the spectral gaps differ by at most polynomial factors in the number of blocks. As an application of the general results, a deterministic-scan conditional Metropolis-adjusted…
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.
