Show simple item record

dc.contributor.authorPoggio, Tomasoen_US
dc.contributor.authorRifkin, Ryanen_US
dc.contributor.authorMukherjee, Sayanen_US
dc.contributor.authorRakhlin, Alexen_US
dc.date.accessioned2004-10-20T21:04:57Z
dc.date.available2004-10-20T21:04:57Z
dc.date.issued2002-03-01en_US
dc.identifier.otherAIM-2002-003en_US
dc.identifier.otherCBCL-214en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/7268
dc.description.abstractIntuitively, 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.en_US
dc.format.extent7 p.en_US
dc.format.extent906324 bytes
dc.format.extent285651 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-2002-003en_US
dc.relation.ispartofseriesCBCL-214en_US
dc.subjectAIen_US
dc.subjectBaggingen_US
dc.subjectstabilityen_US
dc.subjectregularizationen_US
dc.titleBagging Regularizesen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record