On additive averaging kernels for finite Markov chains
Ryan J.Y. Lim, Michael C.H. Choi

TL;DR
This paper investigates additive mixtures of Markov kernels, deriving explicit formulas and optimization methods to improve convergence rates for Markov chain sampling, with applications demonstrated on the Curie-Weiss model.
Contribution
It introduces a structured approach to optimize additive Markov kernels using spectral and combinatorial techniques, enhancing convergence speed.
Findings
Explicit trace formulas for Frobenius norm minimization.
Cheeger-type functional characterizes optimal partitions.
Numerical experiments show improved convergence with tuned parameters.
Abstract
We study additive mixtures of Markov kernels of the form , where , is a baseline sampler and is a Gibbs kernel induced by a partition of the state space. We first motivate the study of , which can be interpreted as the projection of a lifted Markov chain. We then consider the minimisation of distance to stationarity under two objectives: the squared Frobenius norm and the Kullback-Leibler (KL) divergence. For the Frobenius objective, we derive explicit trace formulas and identify a Cheeger-type functional that characterises optimal two-block partitions. This yields a structured combinatorial optimisation problem admitting a difference-of-submodular decomposition, enabling efficient approximation via majorisation-minimisation. We also obtain geometric decay rates governed by the absolute spectral gap of . For the…
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.
