Adaptive Importance Sampling in General Mixture Classes - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2008

Adaptive Importance Sampling in General Mixture Classes

Résumé

In this paper, we propose an adaptive algorithm that iteratively updates both the weights and component parameters of a mixture importance sampling density so as to optimise the performance of importance sampling, as measured by an entropy criterion. The method, called M-PMC, is shown to be applicable to a wide class of importance sampling densities, which includes in particular mixtures of multivariate Student $t$ distributions. The performance of the proposed scheme is studied on both artificial and real examples, highlighting in particular the benefit of a novel Rao-Blackwellisation device which can be easily incorporated in the updating scheme.
Fichier principal
Vignette du fichier
RR-6332.pdf (684.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00181474 , version 1 (24-10-2007)
inria-00181474 , version 2 (24-10-2007)
inria-00181474 , version 3 (25-10-2007)
inria-00181474 , version 4 (03-03-2008)

Identifiants

  • HAL Id : inria-00181474 , version 4

Citer

Olivier Cappé, Randal Douc, Arnaud Guillin, Jean-Michel Marin, Christian P. Robert. Adaptive Importance Sampling in General Mixture Classes. [Research Report] RR-6332, INRIA. 2008. ⟨inria-00181474v4⟩
530 Consultations
658 Téléchargements

Partager

Gmail Facebook X LinkedIn More