The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Learning in the Recurrent Random Neural Network
Abstract
The capacity to learn from examples is one of the most desirable features of neural network models. We present a learning algorithm for the recurrent random network model (Gelenbe 1989, 1990) using gradient descent of a quadratic error function. The analytical properties of the model lead to a "backpropagation" type algorithm that requires the solution of a system of n linear and n nonlinear equations each time the n-neuron network "learns" a new input-output pair.
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
(1982) · Trends in Neurosciences · doi:10.1016/0166-2236(82)90076-5 · Cited by 9,089
A learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
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
Random Neural Networks with Negative and Positive Signals and Product Form Solution
Gelenbe, E. (1989) · Neural Computation · doi:10.1162/neco.1989.1.4.502 · Cited by 629
Self-citationA learning rule for asynchronous perceptrons with feedback in a combinatorial environment
Almeida, L. B. (1990) · IEEE Press eBooks · Cited by 280
Learning state space trajectories in recurrent neural networks
Pearlmutter (1989) · International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1989.118724 · Cited by 186
Recurrent Backpropagation and the Dynamical Approach to Adaptive Neural Computation
Pineda, F. J. (1989) · Neural Computation · doi:10.1162/neco.1989.1.2.161 · Cited by 183
Neural net algorithms that learn in polynomial time from examples and queries
Baum, E. B. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80287 · Cited by 168
Generalization of Back propagation to Recurrent and Higher Order Neural Networks
Pineda, F. J. (1987) · neural information processing systems · Cited by 127
Cited by
Dounis, A. I., & Caraiscos, C. (2009) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2008.09.015 · Cited by 851
Randomness in neural networks: an overview
Scardapane, S., & Wang, D. (2017) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1200 · Cited by 352
Metadata
- Authors
- Gelenbe, E.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1993-01
- Volume
- 5
- Issue
- 1
- Pages
- 154-164
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W1996503769
- Cited by
- 366
- References
- 10
- FWCI
- 4.44
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Learning in the Recurrent Random Neural Network. https://app.cochat.ai/papers/10.1162/neco.1993.5.1.154
- The paper
- Gelenbe, E. (1993). Learning in the Recurrent Random Neural Network. Neural Computation. https://doi.org/10.1162/neco.1993.5.1.154
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.