An overview of gradient descent optimization algorithms
Machine Learning
2017-06-16 v2
Abstract
Gradient descent optimization algorithms, while increasingly popular, are often used as black-box optimizers, as practical explanations of their strengths and weaknesses are hard to come by. This article aims to provide the reader with intuitions with regard to the behaviour of different algorithms that will allow her to put them to use. In the course of this overview, we look at different variants of gradient descent, summarize challenges, introduce the most common optimization algorithms, review architectures in a parallel and distributed setting, and investigate additional strategies for optimizing gradient descent.
Cite
@article{arxiv.1609.04747,
title = {An overview of gradient descent optimization algorithms},
author = {Sebastian Ruder},
journal= {arXiv preprint arXiv:1609.04747},
year = {2017}
}
Comments
Added derivations of AdaMax and Nadam