Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Breiman, L.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Breiman, L.
(Neural Computation. 1999;11:1493-1517.)
© 1999 The MIT Press

Prediction Games and Arcing Algorithms

Leo Breiman

Statistics Department, University of California, Berkeley, CA 94720, U.S.A.

The theory behind the success of adaptive reweighting and combining algorithms (arcing) such as Adaboost (Freund & Schapire, 1996a, 1997) and others in reducing generalization error has notbeen well understood. By formulating prediction as a game where one player makes a selection from instances in the training set and the other a convex linear combination of predictors from a finite set, existing arcing algorithms are shown to be algorithms for finding good game strategies. The minimax theorem is an essential ingredient of the convergence proofs. An arcing algorithm is described that converges to the optimal strategy. A bound on the generalization error for the combined predictors in terms of their maximum error is proven that is sharper than bounds to date. Schapire, Freund, Bartlett, and Lee (1997) offered an explanation of why Adaboost works in terms of its ability to produce generally high margins. The empirical comparison of Adaboost to the optimal arcing algorithm shows that their explanation is not complete.




This article has been cited by other articles:


Home page
BiostatisticsHome page
W. Lu and L. Li
Boosting method for nonlinear transformation models with censored survival data
Biostat., October 1, 2008; 9(4): 658 - 667.
[Abstract] [Full Text] [PDF]


Home page
JOURNAL OF FINANCIAL ECONOMETRICSHome page
F. Audrino and F. Trojani
Accurate Short-Term Yield Curve Forecasting using Functional Gradient Descent
J. Financial Econometrics, October 1, 2007; 5(4): 591 - 623.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
R. Mehrian-Shai, C. D. Chen, T. Shi, S. Horvath, S. F. Nelson, J. K. V. Reichardt, and C. L. Sawyers
Insulin growth factor-binding protein 2 is a candidate biomarker for PTEN status and PI3K/Akt pathway activation in glioblastoma and prostate cancer
PNAS, March 27, 2007; 104(13): 5563 - 5568.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
W. Truccolo and J. P. Donoghue
Nonparametric Modeling of Neural Point Processes via Stochastic Gradient Boosting Regression.
Neural Comput., March 1, 2007; 19(3): 672 - 705.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 1999 by The MIT Press.