Computational Efficiency in Bayesian Model and Variable Selection
Jana Eklund and
Sune Karlsson ()
No 2007:4, Working Papers from Örebro University, School of Business
Large scale Bayesian model averaging and variable selection exercises present, despite the great increase in desktop computing power, considerable computational challenges. Due to the large scale it is impossible to evaluate all possible models and estimates of posterior probabilities are instead obtained from stochastic (MCMC) schemes designed to converge on the posterior distribution over the model space. While this frees us from the requirement of evaluating all possible models the computational effort is still substantial and efficient implementation is vital. Efficient implementation is concerned with two issues: the efficiency of the MCMC algorithm itself and efficient computation of the quantities needed to obtain a draw from the MCMC algorithm. We evaluate several different MCMC algorithms and find that relatively simple algorithms with local moves perform competitively except possibly when the data is highly collinear. For the second aspect, efficient computation within the sampler, we focus on the important case of linear models where the computations essentially reduce to least squares calculations. Least squares solvers that update a previous model estimate are appealing when the MCMC algorithm makes local moves and we find that the Cholesky update is both fast and accurate.
Keywords: Bayesian Model Averaging; Sweep operator; Cholesky decomposition; QR decomposition; Swendsen-Wang algorithm (search for similar items in EconPapers)
JEL-codes: C11 C15 C52 C63 (search for similar items in EconPapers)
New Economics Papers: this item is included in nep-cmp, nep-ecm and nep-lab
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (2) Track citations by RSS feed
Downloads: (external link)
https://www.oru.se/globalassets/oru-sv/institution ... rs2007/wp-4-2007.pdf (application/pdf)
Working Paper: Computational Efficiency in Bayesian Model and Variable Selection (2007)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: http://EconPapers.repec.org/RePEc:hhs:oruesi:2007_004
Access Statistics for this paper
More papers in Working Papers from Örebro University, School of Business Örebro University School of Business, SE - 701 82 ÖREBRO, Sweden. Contact information at EDIRC.
Series data maintained by ().