AdaBoost and Forward Stagewise Regression are First-Order Convex Optimization Methods

A. S. Nemirovsky and D. B. Yudin, Problem complexity and method efficiency in optimization , Wiley, New York, 1983

1983

Earlier work this paper cites.

B. Polyak, Introduction to optimization , Optimization Software, Inc., New York, 1987

1987

Earlier work this paper cites.

R. Tibshirani, Regression shrinkage and selection via the lasso , Journal of the Royal Statistical Society, Series B 58

1996

Earlier work this paper cites.

R. E. Schapire, Y. Freund, P. Bartlett, and W. S. Lee, Boosting the margin: a new explanation for the effectiveness of voting methods , Proc. 14th International Conference on Machine Learning, Morgan Kaufmann, 1997, pp. 322–330

1997

Earlier work this paper cites.

D. Bertsekas, Nonlinear programming , Athena Scientific, Belmont, MA, 1999

1999

Earlier work this paper cites.

Y. Freund and R. E. Schapire, A short introduction to boosting , Journal of Japanese Society for Artificial Intelligence 14

1999

Earlier work this paper cites.

L. Mason, J. Baxter, P. Bartlett, and M. R. Frean, Boosting algorithms as gradient descent , NIPS (Sara A. Solla, Todd K. Leen, and Klaus-Robert Müller, eds.), The MIT Press, 1999, pp. 512–518

1999

Earlier work this paper cites.

Jerome H. Friedman, Greedy function approximation: A gradient boosting machine , Annals of Statistics 29

2000

Earlier work this paper cites.

A. Beck and M. Teboulle, Mirror descent and nonlinear projected subgradient methods for convex optimization , Operations Research Letters 31

2003

Cited alongside, same era.

Y. E. Nesterov, Introductory lectures on convex optimization: a basic course , Applied Optimization, vol. 87, Kluwer Academic Publishers, Boston, 2003

2003

Cited alongside, same era.

R. E. Schapire, The boosting approach to machine learning: an overview , Nonlinear Estimation and Classification (D. D. Denison, M. H. Hansen, C. Holmes, B. Mallick, and B. Yu, eds.), Springer, 2003

2003

Cited alongside, same era.

Bradley Efron, Trevor Hastie, Iain Johnstone, and Robert Tibshirani, Least angle regression (with discussion) , Annals of Statistics 32

2004

Cited alongside, same era.

C. Rudin, I. Daubechies, and R. E. Schapire, The dynamics of AdaBoost: Cyclic behavior and convergence of margins , Journal of Machine Learning Research 5

C. Rudin, R.E. Schapire, and I. Daubechies, Analysis of boosting algorithms using the smooth margin function , Annals of Statistics (2007), 2723–2768

2007

Later among the works it cites.

T. Hastie, R. Tibshirani, and J. Friedman, Elements of statistical learning: Data mining, inference, and prediction , Springer Verlag, New York, 2009

2009

Later among the works it cites.

S. Shalev-Shwartz and Y. Singer, On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms , Machine Learning 80

2010

Later among the works it cites.

I. Mukherjee, C. Rudin, and R. E. Schapire, The rate of convergence of AdaBoost , Journal of Machine Learning Research - Proceedings Track 19

2011

Later among the works it cites.

Matus J. Telgarsky, The fast convergence of boosting , Advances in Neural Information Processing Systems 24 (J. Shawe-Taylor, R.S. Zemel, P. Bartlett, F.C.N. Pereira, and K.Q. Weinberger, eds.), 2011, pp. 1593–1601