Smoothness of Metropolis-Hastings algorithm and application to entropy estimation - Laboratoire d'Analyse et de Mathématiques Appliquées Accéder directement au contenu
Article Dans Une Revue ESAIM: Probability and Statistics Année : 2012

Smoothness of Metropolis-Hastings algorithm and application to entropy estimation

Résumé

The transition kernel of the well-known Metropolis-Hastings (MH) algorithm has a point mass at the chain's current position, which prevent direct smoothness properties to be derived for the successive densities of marginals issued from this algorithm. We show here that under mild smoothness assumption on the MH algorithm "input" densities (the initial, proposal and target distributions), propagation of a Lipschitz condition for the iterative densities can be proved. This allows us to build a consistent nonparametric estimate of the entropy for these iterative densities. This theoretical study can be viewed as a building block for a more general MCMC evaluation tool grounded on such estimates.

Dates et versions

hal-00803167 , version 1 (21-03-2013)

Identifiants

Citer

Didier Chauveau, Pierre Vandekerkhove. Smoothness of Metropolis-Hastings algorithm and application to entropy estimation. ESAIM: Probability and Statistics, 2012, 10.1051/ps/2012004. ⟨10.1051/ps/2012004⟩. ⟨hal-00803167⟩
87 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More