Journal
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS
Volume 25, Issue 4, Pages 1026-1040Publisher
AMER STATISTICAL ASSOC
DOI: 10.1080/10618600.2015.1089775
Keywords
Classification; Generalized partially linear additive models; Group lasso; Regression; Sparsity
Categories
Funding
- NSF [IIS-0911036, IIS-1012593]
Ask authors/readers for more resources
The generalized partially linear additive model (GPLAM) is a flexible and interpretable approach to building predictive models. It combines features in an additive manner, allowing each to have either a linear or nonlinear effect on the response. However, the choice of which features to treat as linear or nonlinear is typically assumed known. Thus, to make a GPLAM a viable approach in situations in which little is known a priori about the features, one must overcome two primary model selection challenges: deciding which features to include in the model and determining which of these features to treat nonlinearly. We introduce the sparse partially linear additive model (SPLAM), which combines model fitting and both of these model selection challenges into a single convex optimization problem. SPLAM provides a bridge between the lasso and sparse additive models. Through a statistical oracle inequality and thorough simulation, we demonstrate that SPLAM can outperform other methods across a broad spectrum of statistical regimes, including the high-dimensional (p >> N) setting. We develop efficient algorithms that are applied to real datasets with half a million samples and over 45,000 features with excellent predictive performance. Supplementary materials for this article are available online.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available