Comment: Boosting Algorithms: Regularization, Prediction and Model Fitting
Andreas Buja, David Mease, Abraham J. Wyner

TL;DR
This paper provides a comprehensive, high-level overview of boosting algorithms, their interpretations, and diverse applications in statistical modeling, highlighting recent extensions and practical software tools for experimentation.
Contribution
It offers a coherent interpretation of boosting, explores its extensions beyond classification, and discusses recent developments in regularization and model selection.
Findings
Boosting has broad applications from classification to survival analysis.
Recent work extends boosting to regularization and model selection.
Software tools facilitate experimentation with boosting methods.
Abstract
The authors are doing the readers of Statistical Science a true service with a well-written and up-to-date overview of boosting that originated with the seminal algorithms of Freund and Schapire. Equally, we are grateful for high-level software that will permit a larger readership to experiment with, or simply apply, boosting-inspired model fitting. The authors show us a world of methodology that illustrates how a fundamental innovation can penetrate every nook and cranny of statistical thinking and practice. They introduce the reader to one particular interpretation of boosting and then give a display of its potential with extensions from classification (where it all started) to least squares, exponential family models, survival analysis, to base-learners other than trees such as smoothing splines, to degrees of freedom and regularization, and to fascinating recent work in model…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
