|
|
||||||||
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:
![]() |
W. Lu and L. Li Boosting method for nonlinear transformation models with censored survival data Biostat., March 15, 2008; (2008) kxn005v1. [Abstract] [Full Text] [PDF] |
||||
![]() |
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] |
||||
![]() |
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] |
||||
![]() |
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 |