Practical Gauss-Newton Optimisation for Deep Learning
Abstract
We present an efficient block-diagonal approximation to the Gauss-Newton matrix for feedforward neural networks. Our resulting algorithm is competitive against state-of-the-art first-order optimisation methods, with sometimes significant improvement in optimisation performance. Unlike first-order methods, for which hyperparameter tuning of the optimisation parameters is often a laborious process, our approach can provide good performance even when used with default settings. A side result of our work is that for piecewise linear transfer functions, the network objective function can have no differentiable local maxima, which may partially explain why such transfer functions facilitate effective optimisation.
Cite
Text
Botev et al. "Practical Gauss-Newton Optimisation for Deep Learning." International Conference on Machine Learning, 2017.Markdown
[Botev et al. "Practical Gauss-Newton Optimisation for Deep Learning." International Conference on Machine Learning, 2017.](https://mlanthology.org/icml/2017/botev2017icml-practical/)BibTeX
@inproceedings{botev2017icml-practical,
title = {{Practical Gauss-Newton Optimisation for Deep Learning}},
author = {Botev, Aleksandar and Ritter, Hippolyt and Barber, David},
booktitle = {International Conference on Machine Learning},
year = {2017},
pages = {557-565},
volume = {70},
url = {https://mlanthology.org/icml/2017/botev2017icml-practical/}
}