Principal component-guided sparse regression

From MaRDI portal
Publication:135079

DOI10.48550/ARXIV.1810.04651zbMATH Open1492.62116arXiv1810.04651OpenAlexW3152849944MaRDI QIDQ135079FDOQ135079

Robert Tibshirani, Jing-Yi Tay, Jerome Friedman, J. Kenneth Tay, Robert Tibshirani, Jerome H. Friedman

Publication date: 10 October 2018

Published in: The Canadian Journal of Statistics (Search for Journal in Brave)

Abstract: We propose a new method for supervised learning, especially suited to wide data where the number of features is much greater than the number of observations. The method combines the lasso (ell1) sparsity penalty with a quadratic penalty that shrinks the coefficient vector toward the leading principal components of the feature matrix. We call the proposed method the "principal components lasso" ("pcLasso"). The method can be especially powerful if the features are pre-assigned to groups (such as cell-pathways, assays or protein interaction networks). In that case, pcLasso shrinks each group-wise component of the solution toward the leading principal components of that group. In the process, it also carries out selection of the feature groups. We provide some theory for this method and illustrate it on a number of simulated and real data examples.


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






Cited In (7)






This page was built for publication: Principal component-guided sparse regression

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