scispace - formally typeset
Journal ArticleDOI

Learning long-term dependencies with gradient descent is difficult

TLDR
This work shows why gradient based learning algorithms face an increasingly difficult problem as the duration of the dependencies to be captured increases, and exposes a trade-off between efficient learning by gradient descent and latching on information for long periods.
Abstract
Recurrent neural networks can be used to map input sequences to output sequences, such as for recognition, production or prediction problems. However, practical difficulties have been reported in training recurrent neural networks to perform tasks in which the temporal contingencies present in the input/output sequences span long intervals. We show why gradient based learning algorithms face an increasingly difficult problem as the duration of the dependencies to be captured increases. These results expose a trade-off between efficient learning by gradient descent and latching on information for long periods. Based on an understanding of this problem, alternatives to standard gradient descent are considered. >

read more

Citations
More filters
Journal ArticleDOI

Handbook of Neural Network Signal Processing

TL;DR: The Handbook of Neural Network Signal Processing brings together applications that were previously scattered among various publications to provide an up-to-date, detailed treatment of the subject from an engineering point of view.
Journal ArticleDOI

Data-driven forecasting of high-dimensional chaotic systems with long short-term memory networks

TL;DR: In this paper, a data-driven forecasting method for high-dimensional chaotic systems using long short-term memory (LSTM) recurrent neural networks is introduced. But the LSTM neural networks perform inference of highdimensional dynamical systems in their reduced order space and are shown to be an effective set of nonlinear approximators of their attractor.
Proceedings ArticleDOI

Malware classification with recurrent networks

TL;DR: This work proposes a different approach, which, similar to natural language modeling, learns the language of malware spoken through the executed instructions and extracts robust, time domain features.
Posted Content

C-RNN-GAN: Continuous recurrent neural networks with adversarial training

TL;DR: A generative adversarial model that works on continuous sequential data is proposed, and it generates music that sounds better and better as the model is trained, report statistics on generated music, and let the reader judge the quality by downloading the generated songs.
Journal ArticleDOI

Protein–Ligand Scoring with Convolutional Neural Networks

TL;DR: In this article, a CNN scoring function automatically learns the key features of protein-ligand interactions that correlate with binding, which can be used to discriminate between correct and incorrect binding poses and known binders and non-binders.
References
More filters
Journal ArticleDOI

Optimization by Simulated Annealing

TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book ChapterDOI

Learning internal representations by error propagation

TL;DR: This chapter contains sections titled: The Problem, The Generalized Delta Rule, Simulation Results, Some Further Generalizations, Conclusion.
Book

Learning internal representations by error propagation

TL;DR: In this paper, the problem of the generalized delta rule is discussed and the Generalized Delta Rule is applied to the simulation results of simulation results in terms of the generalized delta rule.
Journal ArticleDOI

A learning algorithm for continually running fully recurrent neural networks

TL;DR: The exact form of a gradient-following learning algorithm for completely recurrent networks running in continually sampled time is derived and used as the basis for practical algorithms for temporal supervised learning tasks.
Journal ArticleDOI

Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here

TL;DR: A new global optimization algorithm for functions of continuous variables is presented, derived from the “Simulated Annealing” algorithm recently introduced in combinatorial optimization, which is quite costly in terms of function evaluations, but its cost can be predicted in advance, depending only slightly on the starting point.
Related Papers (5)