Optimal rates for regularized least-squares algorithm
We develop a theoretical analysis of generalization performances of regularized leastsquares on reproducing kernel Hilbert spaces for supervised learning. We show that the concept of effective dimension of an integral operator plays a central role in the d
massachusetts institute of technology — computer science and artificial intelligence laboratoryFast Rates for Regularized
Least-squares Algorithm
Andrea Caponnetto and Ernesto De Vito
AI Memo 2005-013
CBCLMemo 248April 2005
