Pré-Publication, Document De Travail Année : 2026

Ergodicity of an Adaptive MCMC Sampler under a Probability Bound

Résumé

This paper provides sufficient conditions over the sequence of samples and parameters of an adaptive Markov Chain Monte Carlo (MCMC) algorithm to ensure ergodicity with respect to a target distribution that can have unbounded support. These conditions aim to make more easily usable the conditions of Containment and Diminishing Adaptation from Roberts and Rosenthal [2007] formulated over the transition kernels, without needing, as was done in other works, an artificial assumption of the compactness over both sample and parameter spaces. The paper shows that the condition of compactness can be relaxed to a more realistic bound in probability over the sequence of both samples and parameters.

Mots clés

Fichier principal
Vignette du fichier
mh_containment_da_conditions.pdf (278.49 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05496174 , version 1 (05-02-2026)
hal-05496174 , version 2 (13-02-2026)

Licence

Identifiants

Citer

Alexandre Chotard. Ergodicity of an Adaptive MCMC Sampler under a Probability Bound. 2026. ⟨hal-05496174v2⟩
103 Consultations
92 Téléchargements

Altmetric

Partager

  • More