Fetching the paper…
Reading the bibliography…
Boosting combines weak learners into a predictor with low empirical risk.
The strength of weak learnability
Robert E. Schapire · 1990
Earlier work this paper cites.
On the convergence of the coordinate descent method for convex differentiable minimization
Z. Q. Luo and P. Tseng · 1992
Earlier work this paper cites.
Boosting a weak learning algorithm by majority
Yoav Freund · 1995
Earlier work this paper cites.
Hard-core distributions for somewhat hard problems
Russell Impagliazzo · 1995
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E. Schapire · 1997
Earlier work this paper cites.
Boosting the margin: A new explanation for the effectiveness of voting methods
Robert E. Schapire, Yoav Freund, Peter Barlett, and Wee Sun Lee · 1997
Earlier work this paper cites.
Nonlinear Programming
Dimitri P. Bertsekas · 1999
Earlier work this paper cites.
Prediction games and arcing algorithms
Leo Breiman · 1999
Earlier work this paper cites.
Boosting as entropy projection
Jyrki Kivinen and Manfred K. Warmuth · 1999
Earlier work this paper cites.
Improved boosting algorithms using confidence-rated predictions
Robert E. Schapire and Yoram Singer · 1999
Cited alongside, same era.
Convex Analysis and Nonlinear Optimization
Jonathan Borwein and Adrian Lewis · 2000
Cited alongside, same era.
Additive logistic regression: a statistical view of boosting
Jerome Friedman, Trevor Hastie, and Robert Tibshirani · 2000
Cited alongside, same era.
Functional gradient techniques for combining hypotheses
Llew Mason, Jonathan Baxter, Peter L. Bartlett, and Marcus R. Frean · 2000
Cited alongside, same era.
Fundamentals of Convex Analysis
Jean-Baptiste Hiriart-Urruty and Claude Lemaréchal · 2001
Cited alongside, same era.
On the convergence of leveraging
Gunnar Rätsch, Sebastian Mika, and Manfred K. Warmuth · 2001
Cited alongside, same era.
Linear Programming 2: Theory and Extensions
George B. Dantzig and Mukund N. Thapa · 2003
Later among the works it cites.
Convex Optimization
Stephen P. Boyd and Lieven Vandenberghe · 2004
Later among the works it cites.
Theory of classification: A survey of some recent advances
Stéphane Boucheron, Olivier Bousquet, and Gabor Lugosi · 2005
Later among the works it cites.
Some theory for generalized boosting algorithms
Peter J. Bickel, Yaacov Ritov, and Alon Zakai · 2006
Later among the works it cites.
Numerical optimization
Jorge Nocedal and Stephen J. Wright · 2006
Later among the works it cites.
Boosting algorithms for maximizing the soft margin
Manfred K. Warmuth, Karen A. Glocer, and Gunnar Rätsch · 2007
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Motzkin’s transposition theorem, and the related theorems of Farkas, Gordan and Stiemke
Adi Ben-Israel · 2002
Cited alongside, same era.
Logistic regression, AdaBoost and Bregman distances
Michael Collins, Robert E. Schapire, and Yoram Singer · 2002
Cited alongside, same era.
Maximizing the margin with boosting
Gunnar Rätsch and Manfred K. Warmuth · 2002
Cited alongside, same era.
Boosting: Foundations and Algorithms
Robert E. Schapire and Yoav Freund
Cited in the paper.
On the equivalence of weak learnability and linear separability: New relaxations and efficient boosting algorithms
Shai Shalev-Shwartz and Yoram Singer · 2008
Later among the works it cites.
The convergence rate of AdaBoost
Robert E. Schapire · 2010
Later among the works it cites.
The convergence rate of AdaBoost
Indraneel Mukherjee, Cynthia Rudin, and Robert Schapire · 2011
Closest in time.