Cahiers du CEREMADE

Unité Mixte de Recherche du C.N.R.S. N°7534
 
Abstract : 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 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.
 
 
Adaptive Importance Sampling in General Mixture Classes
CAPPE Olivier, DOUC R., GUILLIN Arnaud
MARIN Jean-Michel, ROBERT Christian P.
2007-48
08-11-2007
 
Université de PARIS - DAUPHINE
Place du Maréchal de Lattre De Tassigny - 75775 PARIS CEDEX 16 - FRANCE
Téléphone : +33 (0)1 44-05-49-23 - fax : +33 (0)1 44-05-45-99