about
An overview of gradient descent optimization algorithms (2017) (arxiv.org)
1 point by Anon84 on Mar 26, 2024 | hide | past | pdf | discuss on HN

In plain words: A plain-language tour of gradient descent, the trick that nudges a model's settings downhill to cut its errors, comparing the main variants and when each helps or fails. It also covers common pitfalls, training across many machines, and extra tricks for faster, steadier learning.

Abstract · An overview of gradient descent optimization algorithms

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.

Sebastian Ruder
arXiv:1609.04747 · cs.LG · submitted Sep 15, 2016 · updated Jun 15, 2017
abstract · pdf · html · Added derivations of AdaMax and Nadam

add comment on HN
Also discussed: Jul 2017 (78 points, 8 comments)