The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Gradient descent learning algorithm overview: a general dynamical systems perspective
Abstract
Gives a unified treatment of gradient descent learning algorithms for neural networks using a general framework of dynamical systems. This general approach organizes and simplifies all the known algorithms and results which have been originally derived for different problems (fixed point/trajectory learning), for different models (discrete/continuous), for different architectures (forward/recurrent), and using different techniques (backpropagation, variational calculus, adjoint methods, etc.). The general approach can also be applied to derive new algorithms. The author then briefly examines some of the complexity issues and limitations intrinsic to gradient descent learning. Throughout the paper, the author focuses on the problem of trajectory learning.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Parallel Distributed Processing: Explorations in the Microstructure of Cognition: Foundations
Rumelhart, D. E., McClelland, J. L., & AU (1986) · doi:10.7551/mitpress/5236.001.0001 · Cited by 15,686
Hebb, D. O. (2005) · doi:10.4324/9781410612403 · Cited by 9,825
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
indicated, N. A. (1950) · Journal of Consulting Psychology · doi:10.1037/h0049612 · Cited by 6,923
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
Theory of Functional Differential Equations
Hale, J. K. (1977) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-9892-2 · Cited by 6,870
Impulses and Physiological States in Theoretical Models of Nerve Membrane
FitzHugh, R. (1961) · Biophysical Journal · doi:10.1016/s0006-3495(61)86902-6 · Cited by 6,258
A 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
Neural Information Processing Systems
(2018) · The Deep Learning Revolution · doi:10.7551/mitpress/11474.003.0014 · Cited by 3,730
Neural Networks and the Bias/Variance Dilemma
Geman, S., Bienenstock, E., & Doursat, R. (1992) · Neural Computation · doi:10.1162/neco.1992.4.1.1 · Cited by 3,578
Beyond Regression : "New Tools for Prediction and Analysis in the Behavioral Sciences
Werbos, P. J. (1974) · Medical Entomology and Zoology · Cited by 2,789
Beyond regression : new fools for prediction and analysis in the behavioral sciences
Werbos, P. J. (1974) · Medical Entomology and Zoology · Cited by 2,739
Cohen, M. A., & Grossberg, S. (1983) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1983.6313075 · Cited by 2,541
A model of neuronal bursting using three coupled first order differential equations
Hindmarsh, J. L., & Rose, R. M. (1984) · Proceedings of the Royal Society of London. Series B. Biological Sciences · doi:10.1098/rspb.1984.0024 · Cited by 1,936
Self-organization in a perceptual network
Linsker, R. (1988) · Computer · doi:10.1109/2.36 · Cited by 1,469
Generalization 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
A Steepest-Ascent Method for Solving Optimum Programming Problems
Bryson, A. E., & Denham, W. F. (1962) · Journal of Applied Mechanics · doi:10.1115/1.3640537 · Cited by 492
How delays affect neural dynamics and learning
Baldi, P., & Atiya, A. F. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.298231 · Cited by 429
Self-citationAxonal delay lines for time measurement in the owl's brainstem.
Carr, C. E., & Konishi, M. (1988) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.85.21.8311 · Cited by 322
Characteristics of Random Nets of Analog Neuron-Like Elements
Amarimber, S.-I. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309193 · Cited by 300
Cohen, M. A., & Grossberg, S. (1987) · Advances in Psychology · doi:10.1016/s0166-4115(08)60913-9 · Cited by 279
How Can We Speed Up Matrix Multiplication?
Pan, V. Y. (1984) · SIAM Review · doi:10.1137/1026076 · Cited by 150
Computing with Arrays of Coupled Oscillators: An Application to Preattentive Texture Discrimination
Baldi, P., & Meir, R. (1990) · Neural Computation · doi:10.1162/neco.1990.2.4.458 · Cited by 100
Self-citationOn the stochastic dynamics of neuronal interaction
B, T. J. S. A. (1976) · Biological Cybernetics · doi:10.1007/bf00365086 · Cited by 84
Convergence results in an associative memory model
Komlós, J., & Paturi, R. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90029-9 · Cited by 82
Unnikrishnan, K. P., Hopfield, J. J., & Tank, D. W. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.80888 · Cited by 73
Neurogammon Wins Computer Olympiad
Tesauro, G. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.3.321 · Cited by 71
A Theory for Neural Networks with Time Delays
de Vries, B., & Príncipe, J. C. (1990) · neural information processing systems · Cited by 62
Contrastive Learning and Neural Oscillations
Baldi, P., & Pineda, F. J. (1991) · Neural Computation · doi:10.1162/neco.1991.3.4.526 · Cited by 58
Self-citationFaster Learning for Dynamic Recurrent Backpropagation
Fang, Y., & B, T. J. S. A. (1990) · Neural Computation · doi:10.1162/neco.1990.2.3.270 · Cited by 38
A general weight matrix formulation using optimal control
Farotimi, O., Dembo, A., & Kailath, T. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.97914 · Cited by 17
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Fault diagnosis for rotating machinery using multiple sensors and convolutional neural networks
Xia, M., Li, T., Xu, L., Liu, L., & de Silva, C. W. (2018) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2017.2728371 · Cited by 723
Zhang, J.-R., Zhang, J., Lok, T.-M., & Lyu, M. R. (2007) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.07.025 · Cited by 706
Lusci, A., Pollastri, G., & Baldi, P. (2013) · Journal of Chemical Information and Modeling · doi:10.1021/ci400187y · Cited by 555
Self-citationNew 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
Metadata
- Authors
- Baldi, P.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1995
- Volume
- 6
- Issue
- 1
- Pages
- 182-195
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2124972241
- Cited by
- 258
- References
- 33
- FWCI
- 8.62
- 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.