On Early Stopping in Gradient Descent Learning
- 1.1k Downloads
In this paper we study a family of gradient descent algorithms to approximate the regression function from reproducing kernel Hilbert spaces (RKHSs), the family being characterized by a polynomial decreasing rate of step sizes (or learning rate). By solving a bias-variance trade-off we obtain an early stopping rule and some probabilistic upper bounds for the convergence of the algorithms. We also discuss the implication of these results in the context of classification where some fast convergence rates can be achieved for plug-in classifiers. Some connections are addressed with Boosting, Landweber iterations, and the online learning algorithms as stochastic approximations of the gradient descent method.
KeywordsConvergence Rate Gradient Descent Tikhonov Regularization Reproduce Kernel Hilbert Space Gradient Descent Method
Unable to display preview. Download preview PDF.