PulseAugur
EN
LIVE 10:58:43

New MCMC framework uses contraction principles for mixing-time bounds

By PulseAugur Editorial · [2 sources] ·

Researchers have developed a new framework for analyzing Markov chain Monte Carlo (MCMC) algorithms, focusing on contraction principles. This framework utilizes global and local contraction coefficients under the Eγ-divergence to prove mixing-time bounds. The approach offers direct proofs of exponential convergence for projected Langevin Monte Carlo and provides warm-start convergence bounds for Metropolis-Hastings algorithms, even in heavy-tailed regimes. AI

IMPACT This research introduces a novel theoretical framework for analyzing MCMC algorithms, potentially improving their efficiency and applicability in various AI domains.

RANK_REASON The cluster contains an academic paper detailing a new theoretical framework for MCMC algorithms.

Read on arXiv stat.ML →

AI-generated summary · Google Gemini · from 2 sources. How we write summaries →

COVERAGE [2]

  1. arXiv stat.ML TIER_1 English(EN) · Alireza Daeijavad, Shahab Asoodeh ·

    Local and Global Contraction Principles for MCMC Mixing

    arXiv:2606.03033v1 Announce Type: cross Abstract: We develop a contraction-based framework for proving mixing-time bounds for Markov chain Monte Carlo algorithms. The framework is built around global and local contraction coefficients of Markov kernels under the $\mathsf E_\gamma…

  2. arXiv stat.ML TIER_1 English(EN) · Shahab Asoodeh ·

    Local and Global Contraction Principles for MCMC Mixing

    We develop a contraction-based framework for proving mixing-time bounds for Markov chain Monte Carlo algorithms. The framework is built around global and local contraction coefficients of Markov kernels under the $\mathsf E_γ$-divergence with $γ\ge1$. For projected Langevin Monte…

RELATED ENTITIES

RELATED TOPICS