Bagging Regularizes
Author(s)
Poggio, Tomaso; Rifkin, Ryan; Mukherjee, Sayan; Rakhlin, Alex
DownloadAIM-2002-003.ps (885.0Kb)
Additional downloads
Metadata
Show full item recordAbstract
Intuitively, we expect that averaging --- or bagging --- different regressors with low correlation should smooth their behavior and be somewhat similar to regularization. In this note we make this intuition precise. Using an almost classical definition of stability, we prove that a certain form of averaging provides generalization bounds with a rate of convergence of the same order as Tikhonov regularization --- similar to fashionable RKHS-based learning algorithms.
Date issued
2002-03-01Other identifiers
AIM-2002-003
CBCL-214
Series/Report no.
AIM-2002-003CBCL-214
Keywords
AI, Bagging, stability, regularization