Resumen
The Gibbs sampler is a widely used Markov Chain Monte Carlo algorithm that iteratively samples from conditional distributions of the target probability measure. Assuming log-concavity, we provide a sharp bound on the convergence rate in terms of relative entropy for the random scan version.
Imparte
PhD. Hugo Lavenant
Assistant Professor-Bocconi University”