HackerPapers

arXiv:1609.04747cs.LG

An overview of gradient descent optimization algorithms

Sebastian Ruder

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
Added derivations of AdaMax and Nadam
Journal reference
DOI
Subjects
cs.LGMachine Learning

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Dec 2023 to Dec 2023. Found in 2 HN submissions from Jul 2017 to Mar 2024. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Taking a look at a paper I have that went up this month and another that went up before the dec cutoff on ar5iv, they look 90% OK! Figures with side-by-side plots and algorithm environments are the common culprit for being broken though. Particularly in figures, it seems like…

      trostaftView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.