Just Interpolate: Kernel Ridgeless Regression Can Generalize

Download:

Abstract:

In the absence of explicit regularization, Kernel “Ridgeless” Regression with nonlinear kernels has the potential to fit the training data perfectly. It has been observed empirically, however, that such interpolated solutions can still generalize well on test data. We isolate a phenomenon of implicit regularization for minimum-norm interpolated solutions which is due to a combination of high dimensionality of the input data, curvature of the kernel function, and favorable geometric properties of the data such as an eigenvalue decay of the empirical covariance and kernel matrices. In addition to deriving a data-dependent upper bound on the out-of-sample error, we present experimental evidence suggesting that the phenomenon occurs in the MNIST dataset.

Citation

Tengyuan Liang, and Alexander Rakhlin. 2020. “Just Interpolate: Kernel ‘Ridgeless’ Regression Can Generalize.” The Annals of Statistics 48 (3): 1329–1347.

@article{Liang_2020,
   title={Just interpolate: Kernel “Ridgeless” regression can generalize},
   volume={48},
   ISSN={0090-5364},
   url={http://dx.doi.org/10.1214/19-AOS1849},
   DOI={10.1214/19-aos1849},
   number={3},
   journal={The Annals of Statistics},
   publisher={Institute of Mathematical Statistics},
   author={Liang, Tengyuan and Rakhlin, Alexander},
   year={2020},
   month=jun }