On the Computational Complexity of High-Dimensional Bayesian Variable Selection

Abstract

We study the computational complexity of Markov chain Monte Carlo (MCMC) methods for high-dimensional Bayesian linear regression under sparsity constraints. We first show that a Bayesian approach can achieve variable-selection consistency under relatively mild conditions on the design matrix. We then demonstrate that the statistical criterion of posterior concentration need not imply the computational desideratum of rapid mixing of the MCMC algorithm. By introducing a truncated sparsity prior for variable selection, we provide a set of conditions that guarantee both variable-selection consistency and rapid mixing of a particular Metropolis-Hastings algorithm. The mixing time is linear in the number of covariates up to a logarithmic factor. Our proof controls the spectral gap of the Markov chain by constructing a canonical path ensemble that is inspired by the steps taken by greedy algorithms for variable selection.

42 pages, 3 figures

References in corpus (5)

• Nearly unbiased variable selection under minimax concave penalty
• Spike and slab variable selection: Frequentist and Bayesian strategies
• Limitations of Markov chain Monte Carlo algorithms for Bayesian Inference of phylogeny
• Necessary and Sufficient Conditions for High-Dimensional Posterior Consistency under $g$-Priors
• Convergence rate of Markov chain methods for genomic motif discovery

Cited by in corpus (2)

• Scalable Bayesian Variable Selection Using Nonlocal Prior Densities in Ultrahigh-Dimensional Settings
• Paired-move multiple-try stochastic search for Bayesian variable selection