EconBase
← All papers

High-Dimensional $L_2$Boosting: Rate of Convergence

Ye Luo, Martin Spindler, Jannis Kück

arXiv 29 Feb 2016 · Statistics — Machine Learning · 20 citations (OpenAlex)

arXiv:1602.08927 · PDF · DOI · OpenAlex · Extracted main text

Abstract

Boosting is one of the most significant developments in machine learning. This paper studies the rate of convergence of $L_2$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 $L_2$Boosting. Another variant is \textquotedblleft Orthogonal Boosting\textquotedblright\ where after each step an orthogonal projection is conducted. We show that both post-$L_2$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 $L_2$Boosting depends on the design matrix described by a sparse eigenvalue constant. To show the latter results, we derive new approximation results for the pure greedy algorithm, based on analyzing the revisiting behavior of $L_2$Boosting. We also introduce feasible rules for early stopping, which can be easily implemented and used in applied work. Our results also allow a direct comparison between LASSO and boosting which has been missing from the literature. Finally, we present simulation studies and applications to illustrate the relevance of our theoretical results and to provide insights into the practical aspects of boosting. In these simulation studies, post-$L_2$Boosting clearly outperforms LASSO.

Citation extraction

32
references
51
in-text mentions
32
distinct cited
1
self-citations
9,020
main-text words

appendix boundary found by appendix_command · 62% of the source is main text. Read the extracted text to check this.

Most heavily cited references

The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.

ReferenceIntensityMentionsSectionsMain text
1Jerome H. Friedman (2001) Greedy function approximation: A gradient boosting machine0.87452100%
2Peter Bühlmann (2006) Boosting for high-dimensional linear models0.84333100%
3R. A. DeVore and V. N. Temlyakov (1996) Some remarks on greedy algorithms0.81142100%
4E.D. Livshitz and V.N. Temlyakov (2003) Two lower estimates in greedy approximation0.73732100%
5Peter Bühlmann and Bin Yu (2003) Boosting with the $l_2$ Loss: Regression and classification0.73732100%
6R Core Team (2014) R: A Language and Environment for Statistical Computing0.64422100%
7Victor Chernozhukov, Christian Hansen, and Martin Spindler (2015) hdm: High-Dimensional Metrics, 2015 self0.64422100%
8Leo Breiman (1998) Arcing classifiers0.64422100%
9A. Belloni, D. Chen, V. Chernozhukov, and C. Hansen (2012) Sparse models and methods for optimal instruments with an application to eminent domain0.51121100%
10Peter Bühlmann, Markus Kalisch, and Lukas Meier (2014) High-dimensional statistics with a view toward applications in biology0.51121100%

Showing the top 10 of 32 scored citations.

Cited by, within the corpus

arXiv econ.EM papers that cite this one, ranked by how heavily they lean on it.

Citing paperIntensityMentionsSections
1Double/Debiased Machine Learning for Treatment and Structural Parameters0.40511
2Debiased Machine Learning of Set-Identified Linear Models0.40511
3Regularized Orthogonal Machine Learning for Nonlinear Semiparametric Models0.40511
4Forward-Selected Panel Data Approach for Program Evaluation0.40511
51908.087790.40511
62002.127100.40511
72012.003700.40511
82012.007450.40511
9Orthogonal Series Estimation for the Ratio of Conditional Expectation Functions0.40511
10ddml: Double/debiased machine learning in Stata0.40511