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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/7268 |
| Date | 01 March 2002 |
| Creators | Poggio, Tomaso, Rifkin, Ryan, Mukherjee, Sayan, Rakhlin, Alex |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | en_US |
| Detected Language | English |
| Format | 7 p., 906324 bytes, 285651 bytes, application/postscript, application/pdf |
| Relation | AIM-2002-003, CBCL-214 |
Page generated in 0.0034 seconds