The golden chain - Discussion

• 成果类型: Editorial Material
• 署名作者: Bühlmann, P; Yu, B
• 署名单位: Swiss Federal Institutes of Technology Domain; ETH Zurich; University of California System; University of California Berkeley
• 刊物名称: ANNALS OF STATISTICS
• ISSN/ISSBN: 0090-5364
• 发表日期: 2004
• 页码: 96-101
• 关键词: classification trees; regression; Lasso

摘要

Jiang, Lugosi and Vayatis, and Zhang ought to be congratulated for their different works on the original AdaBoost algorithm with early stopping (Jiang), an l(1)-penalized version of boosting (Lugosi and Vayatis) and a convex minimization method which can be viewed as an l(2)-penalized version of boosting (Zhang).