High-Dimensional $L_2$Boosting: Rate of Convergence
Ye Luo, Martin Spindler, Jannis K\"uck

TL;DR
This paper analyzes the convergence rates of $L_2$Boosting in high-dimensional regression, introduces post-Boosting and orthogonal boosting variants, and compares their performance to LASSO through theory and simulations.
Contribution
It provides new theoretical convergence results for $L_2$Boosting, introduces practical variants like post-Boosting and orthogonal boosting, and compares them to LASSO in high-dimensional settings.
Findings
Post-$L_2$Boosting outperforms LASSO in simulations.
Both post-$L_2$Boosting and orthogonal boosting achieve LASSO's convergence rate.
New approximation results for greedy algorithms are derived.
Abstract
Boosting is one of the most significant developments in machine learning. This paper studies the rate of convergence of Boosting, which is tailored for regression, in a high-dimensional setting. Moreover, we introduce so-called \textquotedblleft post-Boosting\textquotedblright. This is a post-selection estimator which applies ordinary least squares to the variables selected in the first stage by Boosting. Another variant is \textquotedblleft Orthogonal Boosting\textquotedblright\ where after each step an orthogonal projection is conducted. We show that both post-Boosting and the orthogonal boosting achieve the same rate of convergence as LASSO in a sparse, high-dimensional setting. We show that the rate of convergence of the classical Boosting depends on the design matrix described by a sparse eigenvalue constant. To show the latter results, we derive new…
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.
Taxonomy
TopicsBlind Source Separation Techniques · Sparse and Compressive Sensing Techniques · Face and Expression Recognition
