In search of lost mixing time: adaptive Markov chain Monte Carlo schemes for Bayesian variable selection with very large p
From MaRDI portal
Publication:5857977
Abstract: The availability of data sets with large numbers of variables is rapidly increasing. The effective application of Bayesian variable selection methods for regression with these data sets has proved difficult since available Markov chain Monte Carlo methods do not perform well in typical problem sizes of interest. The current paper proposes new adaptive Markov chain Monte Carlo algorithms to address this shortcoming. The adaptive design of these algorithms exploits the observation that in large small settings, the majority of the variables will be approximately uncorrelated a posteriori. The algorithms adaptively build suitable non-local proposals that result in moves with squared jumping distance significantly larger than standard methods. Their performance is studied empirically in high-dimensional problems (with both simulated and actual data) and speedups of up to 4 orders of magnitude are observed. The proposed algorithms are easily implementable on multi-core architectures and are well suited for parallel tempering or sequential Monte Carlo implementations.
Recommendations
- Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable selection
- Extended stochastic gradient Markov chain Monte Carlo for large-scale Bayesian variable selection
- An efficient sampling algorithm with adaptations for Bayesian variable selection
- Bayesian Variable Selection in Markov Mixture Models
- Adaptive sampling for Bayesian variable selection
- An adaptive MCMC method for Bayesian variable selection in logistic and accelerated failure time regression models
- Adaptive Computational Methods for Bayesian Variable Selection
- Reversible jump Markov chain Monte Carlo algorithms for Bayesian variable selection in logistic mixed models
- On Sampling Strategies in Bayesian Variable Selection Problems With Large Model Spaces
- Dimension-Free Mixing for High-Dimensional Bayesian Variable Selection
Cited in
(24)- Sandwich algorithms for Bayesian variable selection
- Embarrassingly parallel sequential Markov-chain Monte Carlo for large sets of time series
- An adaptive MCMC method for Bayesian variable selection in logistic and accelerated failure time regression models
- Adaptive random neighbourhood informed Markov chain Monte Carlo for high-dimensional Bayesian variable selection
- Model-guided adaptive sampling for Bayesian model selection
- Evolutionary stochastic search for Bayesian model exploration
- Additive Bayesian variable selection under censoring and misspecification
- Adaptive sampling for Bayesian variable selection
- Scalable approximate MCMC algorithms for the horseshoe prior
- On the computational complexity of high-dimensional Bayesian variable selection
- Extended stochastic gradient Markov chain Monte Carlo for large-scale Bayesian variable selection
- Bayesian Variable Selection in Markov Mixture Models
- Variational Bayes for High-Dimensional Linear Regression With Sparse Priors
- Bayesian variable selection for non‐Gaussian responses: a marginally calibrated copula approach
- Global–local shrinkage multivariate logit-beta priors for multiple response-type data
- Bayesian prior modeling in vector autoregressions via the Yule-Walker equations
- Dimension-free relaxation times of informed MCMC samplers on discrete spaces
- Expressing and visualizing model uncertainty in Bayesian variable selection using Cartesian credible sets
- A metropolized adaptive subspace algorithm for high-dimensional Bayesian variable selection
- Bayesian inference on hierarchical nonlocal priors in generalized linear models
- Two-step mixed-type multivariate Bayesian sparse variable selection with shrinkage priors
- An invitation to adaptive Markov chain Monte Carlo convergence theory
- Sequential Monte Carlo on large binary sampling spaces
- An efficient sampling algorithm with adaptations for Bayesian variable selection
This page was built for publication: In search of lost mixing time: adaptive Markov chain Monte Carlo schemes for Bayesian variable selection with very large p
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5857977)
