The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
An Efficient Gradient-Based Algorithm for On-Line Training of Recurrent Network Trajectories
Abstract
A novel variant of the familiar backpropagation-through-time approach to training recurrent networks is described. This algorithm is intended to be used on arbitrary recurrent networks that run continually without ever being reset to an initial state, and it is specifically designed for computationally efficient computer implementation. This algorithm can be viewed as a cross between epochwise backpropagation through time, which is not appropriate for continually running networks, and the widely used on-line gradient approximation technique of truncated backpropagation through time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Learning Internal Representations by Error Propagation
Rumelhart, D. E., Hinton, G. E., & Williams, R. J. (1985) · doi:10.21236/ada164453 · Cited by 16,172
Self-citationA Learning Algorithm for Continually Running Fully Recurrent Neural Networks
Williams, R. J., & Zipser, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.270 · Cited by 4,369 · cited 16×
“Using BPTT(16;8) gave an additional factor of 2 speedup: making BPTT(16;8) well over 50 times faster than RTRL on this task.”
BackgroundMethodInfluentialSelf-citationGeneralization of back-propagation to recurrent neural networks
Pineda, F. J. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.2229 · Cited by 931
Learning State Space Trajectories in Recurrent Neural Networks
Pearlmutter, B. A. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.263 · Cited by 656
Finite State Automata and Simple Recurrent Networks
Cleeremans, A., Servan-Schreiber, D., & McClelland, J. L. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.372 · Cited by 458
Experimental Analysis of the Real-time Recurrent Learning Algorithm
WILLIAMS, R. J., & ZIPSER, D. (1989) · Connection Science · doi:10.1080/09540098908915631 · Cited by 292
Self-citationA learning rule for asynchronous perceptrons with feedback in a combinatorial environment
Almeida, L. B. (1990) · IEEE Press eBooks · Cited by 280
Comparison of four neural net learning methods for dynamic system identification
Qin, S.-Z., Su, H.-T., & McAvoy, T. J. (1992) · IEEE Transactions on Neural Networks · doi:10.1109/72.105425 · Cited by 184
A learning algorithm for analog, fully recurrent neural networks
Gherrity (1989) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1989.118645 · Cited by 78
A Subgrouping Strategy that Reduces Complexity and Speeds Up Learning in Recurrent Networks
Zipser, D. (1989) · Neural Computation · doi:10.1162/neco.1989.1.4.552 · Cited by 51
Cited by
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Understanding normal and impaired word reading: Computational principles in quasi-regular domains.
Plaut, D. C., McClelland, J. L., Seidenberg, M. S., & Patterson, K. (1996) · Psychological Review · doi:10.1037/0033-295x.103.1.56 · Cited by 2,698
Harm, M. W., & Seidenberg, M. S. (2004) · Psychological Review · doi:10.1037/0033-295x.111.3.662 · Cited by 1,133
Dota 2 with Large Scale Deep Reinforcement Learning
OpenAI, :, Berner, C., Brockman, G., Chan, B., Cheung, V., Dębiak, P., Dennison, C., Farhi, D., Fischer, Q., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.06680 · Cited by 1,065
“We apply the Adam optimizer [20] using truncated backpropagation through time[21] over samples of 16 timesteps.”
MethodPhonology, reading acquisition, and dyslexia: Insights from connectionist models.
Harm, M. W., & Seidenberg, M. S. (1999) · Psychological Review · doi:10.1037/0033-295x.106.3.491 · Cited by 927
Deep dyslexia: A case study of connectionist neuropsychology
Plaut, D. C., & Shallice, T. (1993) · Cognitive Neuropsychology · doi:10.1080/02643299308253469 · Cited by 856
Exploring the Limits of Language Modeling
Józefowicz, R., Vinyals, O., Schuster, M., Shazeer, N., & Wu, Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1602.02410 · Cited by 823
Learning quadrupedal locomotion over challenging terrain
Lee, J., Hwangbo, J., Wellhausen, L., Koltun, V., & Hutter, M. (2020) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000448343 · Cited by 752
LSTM recurrent networks learn simple context-free and context-sensitive languages
Gers, F. A., & Schmidhuber, E. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.963769 · Cited by 722
Li, X., Peng, L., Yao, X., Cui, S., Hu, Y., You, C., & Chi, T. (2017) · Environmental Pollution · doi:10.1016/j.envpol.2017.08.114 · Cited by 642
Gradient calculations for dynamic recurrent neural networks: a survey
Pearlmutter, B. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.410363 · Cited by 582
Long-Term Wind Speed and Power Forecasting Using Local Recurrent Neural Network Models
Barbounis, T. G., Theocharis, J. B., Alexiadis, M. C., & Dokopoulos, P. S. (2006) · IEEE Transactions on Energy Conversion · doi:10.1109/tec.2005.847954 · Cited by 569
Neurocontrol of nonlinear dynamical systems with Kalman filter trained recurrent networks
Puskorius, G. V., & Feldkamp, L. A. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279191 · Cited by 528
New results on recurrent network training: unifying the algorithms and accelerating convergence
Atiya, A. F., & Parlos, A. G. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.846741 · Cited by 521
Finite State Automata and Simple Recurrent Networks
Cleeremans, A., Servan-Schreiber, D., & McClelland, J. L. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.372 · Cited by 458
Artificial neural network modeling of water table depth fluctuations
Coulibaly, P., Anctil, F., Aravena, R., & Bobée, B. (2001) · Water Resources Research · doi:10.1029/2000wr900368 · Cited by 441
Impairments in verb morphology after brain injury: A connectionist model
Joanisse, M. F., & Seidenberg, M. S. (1999) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.96.13.7592 · Cited by 408
Learning Complex, Extended Sequences Using the Principle of History Compression
Schmidhuber, J. (1992) · Neural Computation · doi:10.1162/neco.1992.4.2.234 · Cited by 398
Li, X., & Wu, X. (2015) · 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2015.7178826 · Cited by 336
Ecoffet, A., Huizinga, J., Lehman, J., Stanley, K. O., & Clune, J. (2021) · Nature · doi:10.1038/s41586-020-03157-9 · Cited by 330
Spoken language understanding using long short-term memory neural networks
Yao, K., Peng, B., Zhang, Y., Yu, D., Zweig, G., & Shi, Y. (2014) · 2014 IEEE Spoken Language Technology Workshop (SLT) · doi:10.1109/slt.2014.7078572 · Cited by 317
Double dissociation without modularity: Evidence from connectionist neuropsychology
Plaut, D. C. (1995) · Journal of Clinical and Experimental Neuropsychology · doi:10.1080/01688639508405124 · Cited by 306
Deep learning for time series forecasting: The electric load case
Gasparin, A., Lukovic, S., & Alippi, C. (2022) · CAAI Transactions on Intelligence Technology · doi:10.1049/cit2.12060 · Cited by 293
Highway long short-term memory RNNS for distant speech recognition
Zhang, Y., Chen, G., Yu, D., Yao, K., Khudanpur, S., & Glass, J. (2016) · 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2016.7472780 · Cited by 290
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303768966139 · Cited by 289
Simple Recurrent Units for Highly Parallelizable Recurrence
Lei, T., Zhang, Y., Wang, S. I., Dai, H., & Artzi, Y. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1477 · Cited by 289
Recurrent Neural Networks for Short-Term Load Forecasting: An Overview and Comparative Analysis
Bianchi, F. M., Maiorino, E., Kampffmeyer, M. C., Rizzi, A., & Jenssen, R. (2017) · SpringerBriefs in Computer Science · doi:10.1007/978-3-319-70338-1 · Cited by 280
Zen, H., & Sak, H. (2015) · 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) · doi:10.1109/icassp.2015.7178816 · Cited by 262
Uddin, M. Z., Hassan, M. M., Alsanad, A., & Savaglio, C. (2020) · Information Fusion · doi:10.1016/j.inffus.2019.08.004 · Cited by 194
Wu, Y., Rabe, M. N., Hutchins, D., & Szegedy, C. (2022) · arXiv · doi:10.48550/arxiv.2203.08913 · Cited by 90
Data-to-text generation with macro planning
Puduppully, R., & Lapata, M. (2021) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00381 · Cited by 53
Hutchins, D., Schlag, I., Wu, Y., Dyer, E., & Neyshabur, B. (2022) · arXiv · doi:10.48550/arxiv.2203.07852 · Cited by 43
Yue, Z., Ding, Y., Zhao, H., & Wang, Z. (2022) · Structures · doi:10.1016/j.istruc.2022.09.011 · Cited by 31
Bonci, A., Fredianelli, L., Kermenov, R., Longarini, L., Longhi, S., Pompei, G., Prist, M., & Verdini, C. (2024) · Applied Sciences · doi:10.3390/app14198686 · Cited by 16
Scaling up Test-Time Compute with Latent Reasoning: A Recurrent Depth Approach
Geiping, J., McLeish, S., Jain, N., Kirchenbauer, J., Singh, S., Bartoldson, B., Kailkhura, B., Bhatele, A., & Goldstein, T. (2025) · Advances in Neural Information Processing Systems 38 · doi:10.52202/085713-1380 · Cited by 10
Recurrent Reinforcement Learning with Memoroids
Morad, S., Lu, C., Kortvelesy, R., Liwicki, S., Foerster, J., & Prorok, A. (2024) · arXiv · doi:10.48550/arxiv.2402.09900 · Cited by 1
Metadata
- Authors
- Williams, R. J., & Peng, J.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1990-12
- Volume
- 2
- Issue
- 4
- Pages
- 490-501
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2057653135
- Cited by
- 577
- References
- 10
- FWCI
- 6.33
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.