Entropy contraction of the Gibbs sampler under log-concavity
Filippo Ascolani, Hugo Lavenant, Giacomo Zanella
TL;DR
This work delivers explicit, dimension-free convergence guarantees for the random-scan Gibbs sampler targeting log-concave distributions on product spaces. By leveraging a novel approximate tensorization of entropy via Knothe–Rosenblatt triangular transport, the authors obtain a sharp KL contraction bound with rate $1/(\kappa^* M)$, with $\kappa^*$ a coordinate-wise condition number, and show linear mixing-time scaling in $M$ and $\kappa^*$ that is independent of ambient dimension. The analysis extends to Metropolis-within-Gibbs and Hit-and-Run, and provides a clear comparison with gradient-based MCMC schemes and optimization. In the non-strongly convex regime, convergence becomes polynomial, but warm-start strategies recover practical guarantees. Overall, the results illuminate when coordinate-wise sampling yields dimension-free efficiency and connect sampling convergence to coordinate-wise convexity and transport inequalities.
Abstract
The Gibbs sampler (a.k.a. Glauber dynamics and heat-bath algorithm) is a popular Markov Chain Monte Carlo algorithm which iteratively samples from the conditional distributions of a probability measure $π$ of interest. Under the assumption that $π$ is strongly log-concave, we show that the random scan Gibbs sampler contracts in relative entropy and provide a sharp characterization of the associated contraction rate. Assuming that evaluating conditionals is cheap compared to evaluating the joint density, our results imply that the number of full evaluations of $π$ needed for the Gibbs sampler to mix grows linearly with the condition number and is independent of the dimension. If $π$ is non-strongly log-concave, the convergence rate in entropy degrades from exponential to polynomial. Our techniques are versatile and extend to Metropolis-within-Gibbs schemes and the Hit-and-Run algorithm. A comparison with gradient-based schemes and the connection with the optimization literature are also discussed.
