A Field Guide to Dynamical Recurrent Networks
The DOI matches its Crossref record.
Abstract
Acquire the tools for understanding new architectures and algorithms of dynamical recurrent networks (DRNs) from this valuable field guide, which documents recent forays into artificial intelligence, control theory, and connectionism. This unbiased introduction to DRNs and their application to time-series problems (such as classification and prediction) provides a comprehensive overview of the recent explosion of leading research in this prolific field. A Field Guide to Dynamical Recurrent Networks emphasizes the issues driving the development of this class of network structures. It provides a solid foundation in DRN systems theory and practice using consistent notation and terminology. Theoretical presentations are supplemented with applications ranging from cognitive modeling to financial forecasting. A Field Guide to Dynamical Recurrent Networks will enable engineers, research scientists, academics, and graduate students to apply DRNs to various real-world problems and learn about different areas of active research. It provides both state-of-the-art information and a road map to the future of cutting-edge dynamical recurrent networks
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
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
Recent advances and applications of machine learning in solid-state materials science
Schmidt, J., Marques, M. R. G., Botti, S., & Marques, M. A. L. (2019) · npj Computational Materials · doi:10.1038/s41524-019-0221-0 · Cited by 2,607
DeepTox: toxicity prediction using deep learning
Mayr, A., Klambauer, G., Unterthiner, T., & Hochreiter, S. (2016) · Frontiers in Environmental Science · doi:10.3389/fenvs.2015.00080 · Cited by 1,081
Multi-column deep neural network for traffic sign classification
Cireşan, D., Meier, U., Masci, J., & Schmidhuber, J. (2012) · Neural Networks · doi:10.1016/j.neunet.2012.02.023 · Cited by 1,057
Neural Network for Graphs: A Contextual Constructive Approach
Micheli, A. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2010350 · Cited by 639
Large-scale comparison of machine learning methods for drug target prediction on ChEMBL
Mayr, A., Klambauer, G., Unterthiner, T., Steijaert, M., Wegner, J. K., Ceulemans, H., Clevert, D.-A., & Hochreiter, S. (2018) · Chemical Science · doi:10.1039/c8sc00148k · Cited by 584
Ding, Y., Jia, M., Miao, Q., & Cao, Y. (2022) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2021.108616 · Cited by 559
Long-term time series prediction with the NARX network: An empirical evaluation
Menezes, J. M. P., & Barreto, G. A. (2008) · Neurocomputing · doi:10.1016/j.neucom.2008.01.030 · Cited by 446
Deep learning and its application in geochemical mapping
Zuo, R., Xiong, Y., Wang, J., & Carranza, E. J. M. (2019) · Earth-Science Reviews · doi:10.1016/j.earscirev.2019.02.023 · Cited by 426
Wu, Y., Sicard, B., & Gadsden, S. A. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124678 · Cited by 357
Recurrent Neural Networks Are Universal Approximators
Schäfer, A. M., & Zimmermann, H. G. (2006) · Lecture Notes in Computer Science · doi:10.1007/11840817_66 · Cited by 297
Arabic text classification using deep learning models
Elnagar, A., Al-Debsi, R., & Einea, O. (2020) · Information Processing & Management · doi:10.1016/j.ipm.2019.102121 · Cited by 274
Training Recurrent Networks by Evolino
Schmidhuber, J., Wierstra, D., Gagliolo, M., & Gomez, F. (2007) · Neural Computation · doi:10.1162/neco.2007.19.3.757 · Cited by 248
Prediction of asynchronous dimensional emotion ratings from audiovisual and physiological data
Ringeval, F., Eyben, F., Kroupi, E., Yuce, A., Thiran, J.-P., Ebrahimi, T., Lalanne, D., & Schuller, B. (2015) · Pattern Recognition Letters · doi:10.1016/j.patrec.2014.11.007 · Cited by 202
Zhai, H., & Alexandrova, A. N. (2016) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6b00994 · Cited by 168
Wollmer, M., Schuller, B., Eyben, F., & Rigoll, G. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2057200 · Cited by 165
Rajendra Kurup, A., Ajith, M., & Martínez Ramón, M. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.08.029 · Cited by 49
On the Ability and Limitations of Transformers to Recognize Formal Languages
Bhattamishra, S., Ahuja, K., & Goyal, N. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.576 · Cited by 48
“It has also been shown that RNN based models can recognize regular languages (Kolen and Kremer, 2001; Korsky and Berwick, 2019) and efforts have been made to extract DFAs from RNNs trained to recognize regular languages (Weiss et al.”
BackgroundMeta-learning of Sequential Strategies
Ortega, P. A., Wang, J. X., Rowland, M., Genewein, T., Kurth-Nelson, Z., Pascanu, R., Heess, N., Veness, J., Pritzel, A., Sprechmann, P., et al. (2019) · arXiv · doi:10.48550/arxiv.1905.03030 · Cited by 47
“If we use a memory-based architecture, such as a recurrent neural network [Elman, 1990, Jordan, 1997, Hochreiter et al., 2001, Kolen and Kremer, 2001, Graves, 2012], then the function f conforms to the interface where π t ∈ ∆( X ) is the current prediction vector, m t and m t − 1 ∈ M are the…”
MethodMoirangthem, D. S., & Lee, M. (2020) · Neural Networks · doi:10.1016/j.neunet.2019.12.022 · Cited by 30
Metadata
- Authors
- Kolen, J. F., & Kremer, S. C.
- Venue
- Institute of Electrical and Electronics Engineers eBooks
- Publisher
- IEEE
- Published
- 2009
- OpenAlex
- W1581242383
- Cited by
- 335
- References
- 0
- FWCI
- 4.52
- Type
- book
- 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.