paper-with-me

홈 › Papers

On the Promise of the Stochastic Generalized Gauss-Newton Method for Training DNNs

2020-06-03 · Matilde Gargiani, Andrea Zanelli, Moritz Diehl, Frank Hutter

Following early work on Hessian-free methods for deep learning, we study a stochastic generalized Gauss-Newton method (SGN) for training DNNs. SGN is a second-order optimization method, with efficient iterations, that we demonstrate to often require substantially fewer iterations than standard SGD to converge. As the name suggests, SGN uses a Gauss-Newton approximation for the Hessian matrix, and, in order to compute an approximate search direction, relies on the conjugate gradient method combined with forward and reverse automatic differentiation. Despite the success of SGD and its first-order variants, and despite Hessian-free methods based on the Gauss-Newton Hessian approximation having been already theoretically proposed as practical methods for training DNNs, we believe that SGN has a lot of undiscovered and yet not fully displayed potential in big mini-batch scenarios. For this setting, we demonstrate that SGN does not only substantially improve over SGD in terms of the number of iterations, but also in terms of runtime. This is made possible by an efficient, easy-to-use and flexible implementation of SGN we propose in the Theano deep learning platform, which, unlike Tensorflow and Pytorch, supports forward automatic differentiation. This enables researchers to further study and improve this promising optimization technique and hopefully reconsider stochastic second-order methods as competitive optimization techniques for training DNNs; we also hope that the promise of SGN may lead to forward automatic differentiation being added to Tensorflow or Pytorch. Our results also show that in big mini-batch scenarios SGN is more robust than SGD with respect to its hyperparameters (we never had to tune its step-size for our benchmarks!), which eases the expensive process of hyperparameter tuning that is instead crucial for the performance of first-order methods.

📄 PDF Abstract BibTeX arXiv:2006.02409

Code (2)

gmatilde/SGN 공식 구현 tf
cor3bit/somax jax

Tasks

Second-order methods

Methods 이 논문이 사용한 방법론

SGD Stochastic Gradient Descent is an iterative optimization technique that uses minibatches of data to form an expectation of the gradient, rather than the full gradient using…

Similar Papers 제목 키워드 기반

Deep Neural Network Learning with Second-Order Optimizers -- a Practical Study with a Stochastic Quasi-Gauss-Newton Method

2020-04-06 · Christopher Thiele, Mauricio Araya-Polo, Detlef Hohl

Training in supervised deep learning is computationally demanding, and the convergence behavior is usually not fully understood. We introduce and study a second-order stochastic quasi-Gauss-Newton (SQGN) optimization met…

Adam or Gauss-Newton? A Comparative Study In Terms of Basis Alignment and SGD Noise

2025-10-15 · Bingbin Liu, Rachit Bansal, Depen Morwani, Nikhil Vyas 외 arxiv

Diagonal preconditioners are computationally feasible approximate to second-order optimizers, which have shown significant promise in accelerating training of deep learning models. Two predominant approaches are based on…

Efficient Subsampled Gauss-Newton and Natural Gradient Methods for Training Neural Networks

2019-06-05 · Yi Ren, Donald Goldfarb

We present practical Levenberg-Marquardt variants of Gauss-Newton and natural gradient methods for solving non-convex optimization problems that arise in training deep neural networks involving enormous numbers of variab…

Disentangling the Gauss-Newton Method and Approximate Inference for Neural Networks

2020-07-21 · Alexander Immer

In this thesis, we disentangle the generalized Gauss-Newton and approximate inference for Bayesian deep learning. The generalized Gauss-Newton method is an optimization method that is used in several popular Bayesian dee…

Deep LearningGaussian Processes

Exact Gauss-Newton Optimization for Training Deep Neural Networks

2024-05-23 · Mikalai Korbit, Adeyemi D. Adeoye, Alberto Bemporad, Mario Zanon

We present EGN, a stochastic second-order optimization algorithm that combines the generalized Gauss-Newton (GN) Hessian approximation with low-rank linear algebra to compute the descent direction. Leveraging the Duncan-…