On the sparse Bayesian learning of linear models

From MaRDI portal



Abstract: This work is a re-examination of the sparse Bayesian learning (SBL) of linear regression models of Tipping (2001) in a high-dimensional setting. We propose a hard-thresholded version of the SBL estimator that achieves, for orthogonal design matrices, the non-asymptotic estimation error rate of sigmasqrtslogp/sqrtn, where n is the sample size, p the number of regressors, sigma is the regression model standard deviation, and s the number of non-zero regression coefficients. We also establish that with high-probability the estimator identifies the non-zero regression coefficients. In our simulations we found that sparse Bayesian learning regression performs better than lasso (Tibshirani (1996)) when the signal to be recovered is strong.











This page was built for publication: On the sparse Bayesian learning of linear models

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