Variational approximation for heteroscedastic linear models and matching pursuit algorithms
David J. Nott, Minh-Ngoc Tran, Chenlei Leng

TL;DR
This paper introduces a computationally efficient variational Bayes approach for high-dimensional heteroscedastic linear regression, along with a novel greedy model selection algorithm inspired by matching pursuit, applicable to large datasets.
Contribution
It develops a closed-form variational lower bound for model selection and proposes a fast greedy search algorithm that extends matching pursuit to complex heteroscedastic models.
Findings
Effective in high-dimensional settings with more predictors than samples
Demonstrated improved computational efficiency in simulations
Successfully applied to real-world prediction problems
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
