Sparse Boosting
Peter Bühlmann, Bin Yu · 2006
We propose Sparse Boosting (the SparseL 2 Boost algorithm), a variant on boosting with the squared error loss. SparseL 2 Boost yields sparser solutions than the previously proposed L 2 Boosting by minimizing some penalized L 2 -loss functions, the FPE model selection criteria, through smallstep gradient descent. Although boosting may give already relatively sparse solutions, for example corresponding to the soft-thresholding estimator in orthogonal linear models, there is sometimes a desire for more sparseness to increase prediction accuracy and ability for better variable selection: such goals can be achieved with SparseL 2 Boost.
Cited by 58 works.
Authors
References
- Bagging Predictors
- Regression Shrinkage and Selection Via the Lasso
- Experiments with a new boosting algorithm
- Exploratory Data Analysis
- Greedy function approximation: A gradient boosting machine.
- Matching pursuits with time-frequency dictionaries
- Multivariate Adaptive Regression Splines
- Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)
- Arcing classifier (with discussion and a rejoinder by the author)
- Statistical Predictor Identification