Statistics – Methodology
Scientific paper
2010-11-22
Statistics
Methodology
35 pages, 3 figures, 4 tables
Scientific paper
10.1007/s11222-011-9243-2
Modern statistical applications involving large data sets have focused attention on statistical methodologies which are both efficient computationally and able to deal with the screening of large numbers of different candidate models. Here we consider computationally efficient variational Bayes approaches to inference in high-dimensional heteroscedastic linear regression, where both the mean and variance are described in terms of linear functions of the predictors and where the number of predictors can be larger than the sample size. We derive a closed form variational lower bound on the log marginal likelihood useful for model selection, and propose a novel fast greedy search algorithm on the model space which makes use of one step optimization updates to the variational lower bound in the current model for screening large numbers of candidate predictor variables for inclusion/exclusion in a computationally thrifty way. We show that the model search strategy we suggest is related to widely used orthogonal matching pursuit algorithms for model search but yields a framework for potentially extending these algorithms to more complex models. The methodology is applied in simulations and in two real examples involving prediction for food constituents using NIR technology and prediction of disease progression in diabetes.
Leng Chenlei
Nott David J.
Tran Minh-Ngoc
No associations
LandOfFree
Variational approximation for heteroscedastic linear models and matching pursuit algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Variational approximation for heteroscedastic linear models and matching pursuit algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Variational approximation for heteroscedastic linear models and matching pursuit algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-657732