Sparse Additive Models
Pradeep Ravikumar, John Lafferty, Han Liu et al. · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 2009
Summary We present a new class of methods for high dimensional non-parametric regression and classification called sparse additive models. Our methods combine ideas from sparse linear modelling and additive non-parametric regression. We derive an algorithm for fitting the models that is practical and effective even when the number of covariates is larger than the sample size. Sparse additive models are essentially a functional version of the grouped lasso of Yuan and Lin. They are also closely related to the COSSO model of Lin and Zhang but decouple smoothing and sparsity, enabling the use of arbitrary non-parametric smoothers. We give an analysis of the theoretical properties of sparse additive models and present empirical results on synthetic and real data, showing that they can be effective in fitting sparse non-parametric models in high dimensional data.
Cited by 535 works. doi:10.1111/j.1467-9868.2009.00718.x Open-access PDF
Authors
References
- Regression Shrinkage and Selection Via the Lasso
- The Elements of Statistical Learning: Data Mining, Inference, and Prediction
- Emergence of simple-cell receptive field properties by learning a sparse code for natural images
- Advances in Neural Information Processing Systems 19
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Model Selection and Estimation in Regression with Grouped Variables
- Generalized Additive Models
- The Adaptive Lasso and Its Oracle Properties
- Asymptotic Statistics