Selection of a MCMC simulation strategy via an entropy convergence criterion - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2006

Selection of a MCMC simulation strategy via an entropy convergence criterion

Résumé

In MCMC methods, such as the Metropolis-Hastings (MH) algorithm, the Gibbs sampler, or recent adaptive methods, many different strategies can be proposed, often associated in practice to unknown rates of convergence. In this paper we propose a simulation-based methodology to compare these rates of convergence, grounded on an entropy criterion computed from parallel (i.i.d.) simulated Markov chains coming from each candidate strategy. Our criterion determines on the very first iterations the best strategy among the candidates. Theoretically, we give for the MH algorithm general conditions under which its successive densities satisfy adequate smoothness and tail properties, so that this entropy criterion can be estimated consistently using kernel density estimate and Monte Carlo integration. Simulated examples are provided to illustrate this convergence criterion.
Fichier principal
Vignette du fichier
Chauveau_EntropyHM06.pdf (393.45 Ko) Télécharger le fichier

Dates et versions

hal-00019174 , version 1 (17-02-2006)
hal-00019174 , version 2 (10-05-2006)
hal-00019174 , version 3 (10-04-2007)

Identifiants

Citer

Didier Chauveau, Pierre Vandekerkhove. Selection of a MCMC simulation strategy via an entropy convergence criterion. 2006. ⟨hal-00019174v2⟩
228 Consultations
1242 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More