Information-Theoretic Generalization Bounds for Stochastic Gradient Descent

Gergely Neu , Gintare Karolina Dziugiate , Mahdi Haghifam , Daniel M. Roy

[Proceedings link] [PDF]

Session: Generalization and PAC-Learning 1 (B)

Session Chair: Dylan Foster

Poster: Poster Session 3

Abstract: We study the generalization properties of the popular stochastic optimization method known as stochastic gradient descent (SGD) for optimizing general non-convex loss functions. Our main contribution is providing upper bounds on the generalization error that depend on local statistics of the stochastic gradients evaluated along the path of iterates calculated by SGD. The key factors our bounds depend on are the variance of the gradients (with respect to the data istribution) and the local smoothness of the objective function along the SGD path, and the sensitivity of the loss function to perturbations to the final output. Our key technical tool is combining the information-theoretic generalization bounds previously used for analyzing randomized variants of SGD with a perturbation analysis of the iterates.

Summary presentation

Full presentation