Majorize-Minimize Adapted Metropolis-Hastings Algorithm - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2018

Majorize-Minimize Adapted Metropolis-Hastings Algorithm

Résumé

The dimension and the complexity of inference problems have dramatically increased in statistical signal processing. It thus becomes mandatory to design improved proposal schemes in Metropolis-Hastings algorithms, providing large proposal transitions that are accepted with high probability. The proposal density should ideally provide an accurate approximation of the target density with a low computational cost. In this paper, we derive a novel Metropolis-Hastings proposal, inspired from Langevin dynamics, where the drift term is preconditioned by an adaptive matrix constructed through a Majorization-Minimization strategy. We propose several variants of low-complexity curvature metrics applicable to large scale problems. We demonstrate the geometric ergodicity of the resulting chain for the class of super-exponential distributions. The proposed method is shown to exhibit a good performance in two signal recovery examples.
Fichier principal
Vignette du fichier
template.pdf (836.66 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01909153 , version 1 (30-10-2018)
hal-01909153 , version 2 (24-01-2020)

Identifiants

  • HAL Id : hal-01909153 , version 1

Citer

Yosra Marnissi, Emilie Chouzenoux, Amel Benazza-Benyahia, Jean-Christophe Pesquet. Majorize-Minimize Adapted Metropolis-Hastings Algorithm. 2018. ⟨hal-01909153v1⟩
241 Consultations
891 Téléchargements

Partager

Gmail Facebook X LinkedIn More