An adaptive Monte-Carlo Markov chain algorithm for inference from mixture signals

Abstract : Adaptive Metropolis (AM) is a powerful recent algorithmic tool in numerical Bayesian data analysis. AM builds on a well-known Markov Chain Monte Carlo algorithm but optimizes the rate of convergence to the target distribution by automatically tuning the design parameters of the algorithm on the fly. Label switching is a major problem in inference on mixture models because of the invariance to symmetries. The simplest (non-adaptive) solution is to modify the prior in order to make it select a single permutation of the variables, introducing an identifiability constraint. This solution is known to cause artificial biases by not respecting the topology of the posterior. In this paper we describe an online relabeling procedure which can be incorporated into the AM algorithm. We give elements of convergence of the algorithm and identify the link between its modified target measure and the original posterior distribution of interest. We illustrate the algorithm on a synthetic mixture model inspired by the muonic water Cherenkov signal of the surface detectors in the Pierre Auger Experiment.
docType_s : Conference papers
Domain :
Contributor : Marechal Françoise <>
Submitted on : Wednesday, July 4, 2012 - 5:00:12 PM
Last modification on : Wednesday, July 4, 2012 - 5:00:12 PM




R. Bardenet, B. Kégl. An adaptive Monte-Carlo Markov chain algorithm for inference from mixture signals. Liliana Teodorescu, David Britton, Nigel Glover, Gudrun Heinrich, Jérôme Lauret, Axel Naumann, Thomas Speer, Pedro Teixeira-Dias. 14th International Workshop on Advanced Computing and Analysis Techniques in Physics Research (ACAT 2011), Sep 2011, Uxbridge, United Kingdom. IOP Publishing, 368, pp.012044, 2012, <10.1088/1742-6596/368/1/012044>. <in2p3-00714497>