Component-wisely sparse boosting

DOI10.1016/j.jkss.2011.08.005zbMath1296.62064OpenAlexW2073265045MaRDI QIDQ743775

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

zbMATH Keywords

generalized additive modelsparsityboostingsmoothly clipped absolute deviation

Mathematics Subject Classification ID

Robustness and adaptive procedures (parametric inference) (62F35) Statistical ranking and selection procedures (62F07)

Cites Work

• Unnamed Item
• Unnamed Item
• Greedy function approximation: A gradient boosting machine.
• Nearly unbiased variable selection under minimax concave penalty
• Boosting on the functional ANOVA decomposition
• Relaxed Lasso
• A decision-theoretic generalization of on-line learning and an application to boosting
• Generalized additive models. With discussion
• Least angle regression. (With discussion)
• On the Bayes-risk consistency of regularized boosting methods.
• Improved boosting algorithms using confidence-rated predictions
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• Smoothly Clipped Absolute Deviation on High Dimensions
• Prediction Games and Arcing Algorithms

This page was built for publication: Component-wisely sparse boosting