Adaptive sampling for Bayesian variable selection
Our paper proposes adaptive Monte Carlo sampling schemes for Bayesian variable selection in linear regression that improve on standard Markov chain methods. We do so by considering Metropolis--Hastings proposals that make use of accumulated information about the posterior distribution obtained during sampling. Adaptation needs to be done carefully to ensure that sampling is from the correct ergodic distribution. We give conditions for the validity of an adaptive sampling scheme in this problem, and for simulating from a distribution on a finite state space in general, and suggest a class of adaptive proposal densities which uses best linear prediction to approximate the Gibbs sampler. Our sampling scheme is computationally much faster per iteration than the Gibbs sampler, and when this is taken into account the efficiency gains when using our sampling scheme compared to alternative approaches are substantial in terms of precision of estimation of posterior quantities of interest for a given amount of computation time. We compare our method with other sampling schemes for examples involving both real and simulated data. The methodology developed in the paper can be extended to variable selection in more general problems. Copyright 2005, Oxford University Press.
Volume (Year): 92 (2005)
Issue (Month): 4 (December)
|Contact details of provider:|| Postal: |
Fax: 01865 267 985
Web page: http://biomet.oxfordjournals.org/
|Order Information:||Web: http://www.oup.co.uk/journals|
When requesting a correction, please mention this item's handle: RePEc:oup:biomet:v:92:y:2005:i:4:p:747-763. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Oxford University Press)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.