Pith

open record

sign in

arxiv: 1906.08482 · v3 · pith:3YWPGIHJ · submitted 2019-06-20 · cs.LG · cs.NE· math.DS· stat.ML

Beyond exploding and vanishing gradients: analysing RNN training using attractors and smoothness

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3YWPGIHJrecord.jsonopen to challenge →

classification cs.LG cs.NEmath.DSstat.ML
keywords explodinggradientsvanishingattractorsdevelopmentsneedprincipleproblem
0
0 comments X
read the original abstract

The exploding and vanishing gradient problem has been the major conceptual principle behind most architecture and training improvements in recurrent neural networks (RNNs) during the last decade. In this paper, we argue that this principle, while powerful, might need some refinement to explain recent developments. We refine the concept of exploding gradients by reformulating the problem in terms of the cost function smoothness, which gives insight into higher-order derivatives and the existence of regions with many close local minima. We also clarify the distinction between vanishing gradients and the need for the RNN to learn attractors to fully use its expressive power. Through the lens of these refinements, we shed new light on recent developments in the RNN field, namely stable RNN and unitary (or orthogonal) RNNs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.