Skip to yearly menu bar Skip to main content


Poster

Learning with SGD and Random Features

Luigi Carratino · Alessandro Rudi · Lorenzo Rosasco

Room 517 AB #127

Keywords: [ Kernel Methods ] [ Learning Theory ] [ Stochastic Methods ]


Abstract:

Sketching and stochastic gradient methods are arguably the most common techniques to derive efficient large scale learning algorithms. In this paper, we investigate their application in the context of nonparametric statistical learning. More precisely, we study the estimator defined by stochastic gradient with mini batches and random features. The latter can be seen as form of nonlinear sketching and used to define approximate kernel methods. The considered estimator is not explicitly penalized/constrained and regularization is implicit. Indeed, our study highlights how different parameters, such as number of features, iterations, step-size and mini-batch size control the learning properties of the solutions. We do this by deriving optimal finite sample bounds, under standard assumptions. The obtained results are corroborated and illustrated by numerical experiments.

Live content is unavailable. Log in and register to view live content