Component-wisely sparse boosting
From MaRDI portal
Publication:743775
DOI10.1016/J.JKSS.2011.08.005zbMATH Open1296.62064OpenAlexW2073265045MaRDI QIDQ743775FDOQ743775
Authors: D. Kharzeev 
Publication date: 30 September 2014
Published in: Journal of the Korean Statistical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jkss.2011.08.005
Recommendations
Statistical ranking and selection procedures (62F07) Robustness and adaptive procedures (parametric inference) (62F35)
Cites Work
- A decision-theoretic generalization of on-line learning and an application to boosting
- Nearly unbiased variable selection under minimax concave penalty
- Greedy function approximation: A gradient boosting machine.
- Least angle regression. (With discussion)
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- Relaxed Lasso
- Prediction Games and Arcing Algorithms
- Improved boosting algorithms using confidence-rated predictions
- Smoothly clipped absolute deviation on high dimensions
- Generalized additive models. With discussion
- On the Bayes-risk consistency of regularized boosting methods.
- Boosting on the functional ANOVA decomposition
- Sparse boosting
Cited In (6)
- General sparse boosting: improving feature selection of \(L_{2}\) boosting by correlation-based penalty family
- Boosting with structural sparsity: a differential inclusion approach
- Wavelet-based gradient boosting
- Probing for sparse and fast variable selection with model-based boosting
- Gradient boosting for high-dimensional prediction of rare events
- Sparse boosting
This page was built for publication: Component-wisely sparse boosting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743775)
