The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Local Feedback Multilayered Networks
Abstract
In this paper, we investigate the capabilities of local feedback multilayered networks, a particular class of recurrent networks, in which feedback connections are only allowed from neurons to themselves. In this class, learning can be accomplished by an algorithm that is local in both space and time. We describe the limits and properties of these networks and give some insights on their use for solving practical problems.
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
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 · cited 1×
“|wikwkjf0(ak(t))(wkkd)q|. ( 17 ) Finally, because of hypothesis (11), it follows that:”
BackgroundGeneralization of back-propagation to recurrent neural networks
Pineda, F. J. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.2229 · Cited by 931 · cited 1×
“Recurrent Networks have recently been investigated by several researchers (Bourlard 1989, Cleereman 1989, Elman 1988, Gherrity 1989, Gori 1989a, Pearlmutter 1989, Pineda 1987, Watrous 1990, Williams 1989) because of these networks’ potential capability of coping with sequential tasks.”
Background
Cited by
Learning long-term dependencies with gradient descent is difficult
Bengio, Y., Simard, P., & Frasconi, P. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279181 · Cited by 8,542
“If w > 1=f (0) = 1, then the autonomous dynamic of this neuron has two attractors x > 0 and x that depend on the value of the weight w [7, 8] (they can be easily obtained as non zero intersections of the curve x = tanh(a) with the line x = a=w).”
BackgroundSelf-citationElectricity price forecasting: A review of the state-of-the-art with a look into the future
Weron, R. (2014) · International Journal of Forecasting · doi:10.1016/j.ijforecast.2014.08.008 · Cited by 1,646
Learning long-term dependencies in NARX recurrent neural networks
Lin, T., Horne, B. G., Tino, P., & Giles, C. L. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.548162 · Cited by 784
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
Computational capabilities of recurrent NARX neural networks
Siegelmann, H. T., Horne, B. G., & Giles, C. L. (1997) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.558801 · Cited by 455
Metadata
- Authors
- Frasconi, P., Gori, M., & Soda, G.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 1992-01
- Volume
- 4
- Issue
- 1
- Pages
- 120-130
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W1996741810
- Cited by
- 189
- References
- 2
- FWCI
- 8.05
- 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.