Bayesian high-dimensional screening via MCMC

From MaRDI portal
Publication:466528

DOI10.1016/J.JSPI.2014.07.002zbMATH Open1307.62075arXiv1302.1154OpenAlexW2016133507MaRDI QIDQ466528FDOQ466528


Authors: Zuofeng Shang, Ping Li Edit this on Wikidata


Publication date: 27 October 2014

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Abstract: We explore the theoretical and numerical property of a fully Bayesian model selection method in sparse ultrahigh-dimensional settings, i.e., pggn, where p is the number of covariates and n is the sample size. Our method consists of (1) a hierarchical Bayesian model with a novel prior placed over the model space which includes a hyperparameter tn controlling the model size, and (2) an efficient MCMC algorithm for automatic and stochastic search of the models. Our theory shows that, when specifying tn correctly, the proposed method yields selection consistency, i.e., the posterior probability of the true model asymptotically approaches one; when tn is misspecified, the selected model is still asymptotically nested in the true model. The theory also reveals insensitivity of the selection result with respect to the choice of tn. In implementations, a reasonable prior is further assumed on tn which allows us to draw its samples stochastically. Our approach conducts selection, estimation and even inference in a unified framework. No additional prescreening or dimension reduction step is needed. Two novel g-priors are proposed to make our approach more flexible. A simulation study is given to display the numerical advantage of our method.


Full work available at URL: https://arxiv.org/abs/1302.1154




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Bayesian high-dimensional screening via MCMC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466528)