A generalized multiple-try version of the Reversible Jump algorithm

Files in This Item:
File Description SizeFormat 
insight_publication.pdf826.83 kBAdobe PDFDownload
Title: A generalized multiple-try version of the Reversible Jump algorithm
Authors: Pandolfi, Slivia
Bartolucci, Francesco
Friel, Nial
Permanent link: http://hdl.handle.net/10197/8372
Date: Apr-2014
Abstract: The Reversible Jump algorithm is one of the most widely used Markov chain Monte Carlo algorithms for Bayesian estimation and model selection. A generalized multiple-try version of this algorithm is proposed. The algorithm is based on drawing several proposals at each step and randomly choosing one of them on the basis of weights (selection probabilities) that may be arbitrarily chosen. Among the possible choices, a method is employed which is based on selection probabilities depending on a quadratic approximation of the posterior distribution. Moreover, the implementation of the proposed algorithm for challenging model selection problems, in which the quadratic approximation is not feasible, is considered. The resulting algorithm leads to a gain in efficiency with respect to the Reversible Jump algorithm, and also in terms of computational effort. The performance of this approach is illustrated for real examples involving a logistic regression model and a latent class model.
Funding Details: Science Foundation Ireland
Type of material: Journal Article
Publisher: Elsevier
Copyright (published version): 2013 Elsevier
Keywords: Machine learningStatisticsBayesian inferenceLatent class modelLogistic modelMarkov chain Monte CarloMetropolis–Hastings algorithm
DOI: 10.1016/j.csda.2013.10.007
Language: en
Status of Item: Peer reviewed
Appears in Collections:Mathematics and Statistics Research Collection
Insight Research Collection

Show full item record

Citations 50

Last Week
Last month
checked on Aug 17, 2018

Download(s) 50

checked on May 25, 2018

Google ScholarTM



This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.