The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Using machine learning to replicate chaotic attractors and calculate Lyapunov exponents from data
Open accessAbstract
We use recent advances in the machine learning area known as “reservoir computing” to formulate a method for model-free estimation from data of the Lyapunov exponents of a chaotic process. The technique uses a limited time series of measurements as input to a high-dimensional dynamical system called a “reservoir.” After the reservoir's response to the data is recorded, linear regression is used to learn a large set of parameters, called the “output weights.” The learned output weights are then used to form a modified autonomous reservoir designed to be capable of producing an arbitrarily long time series whose ergodic properties approximate those of the input signal. When successful, we say that the autonomous reservoir reproduces the attractor's “climate.” Since the reservoir equations and output weights are known, we can compute the derivatives needed to determine the Lyapunov exponents of the autonomous reservoir, which we then use as estimates of the Lyapunov exponents for the original input generating system. We illustrate the effectiveness of our technique with two examples, the Lorenz system and the Kuramoto-Sivashinsky (KS) equation. In the case of the KS equation, we note that the high dimensional nature of the system and the large number of Lyapunov exponents yield a challenging test of our method, which we find the method successfully passes.
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
Deterministic Nonperiodic Flow
Lorenz, E. N. (1963) · Journal of the Atmospheric Sciences · doi:10.1175/1520-0469(1963)020<0130:dnf>2.0.co;2 · Cited by 19,398
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
Hinton, G., Deng, L., Yu, D., Dahl, G., Mohamed, A.-R., Jaitly, N., Senior, A., Vanhoucke, V., Nguyen, P., Sainath, T., et al. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2205597 · Cited by 10,260
Solutions of Ill-Posed Problems.
Bell, J. B., Tikhonov, A. N., & Arsenin, V. Y. (1978) · Mathematics of Computation · doi:10.2307/2006360 · Cited by 8,101
Pattern formation outside of equilibrium
Cross, M. C., & Hohenberg, P. C. (1993) · Reviews of Modern Physics · doi:10.1103/revmodphys.65.851 · Cited by 7,859
Maass, W., Natschläger, T., & Markram, H. (2002) · Neural Computation · doi:10.1162/089976602760407955 · Cited by 4,025
Harnessing Nonlinearity: Predicting Chaotic Systems and Saving Energy in Wireless Communication
Jaeger, H., & Haas, H. (2004) · Science · doi:10.1126/science.1091277 · Cited by 3,811
Reservoir computing approaches to recurrent neural network training
Lukoševičius, M., & Jaeger, H. (2009) · Computer Science Review · doi:10.1016/j.cosrev.2009.03.005 · Cited by 2,956
Nonlinear Time Series Analysis
Kantz, H., & Schreiber, T. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511755798 · Cited by 2,629
Extracting qualitative dynamics from experimental data
Broomhead, D. S., & King, G. P. (1986) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(86)90031-x · Cited by 2,278
Cited by
Modeling the dynamics of PDE systems with physics-constrained deep auto-regressive networks
Geneva, N., & Zabaras, N. (2020) · Journal of Computational Physics · doi:10.1016/j.jcp.2019.109056 · Cited by 339
Cheng, S., Quilodrán-Casas, C., Ouala, S., Farchi, A., Liu, C., Tandeo, P., Fablet, R., Lucor, D., Iooss, B., Brajard, J., et al. (2023) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2023.123537 · Cited by 303
Biferale, L., Bonaccorso, F., Buzzicotti, M., Clark Di Leoni, P., & Gustavsson, K. (2019) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5120370 · Cited by 121
2022 roadmap on neuromorphic computing and engineering
Christensen, D. V., Dittmann, R., Linares-Barranco, B., Sebastian, A., Le Gallo, M., Redaelli, A., Slesazeck, S., Mikolajick, T., Spiga, S., Menzel, S., et al. (2022) · Neuromorphic Computing and Engineering · doi:10.1088/2634-4386/ac4a83
Metadata
- Authors
- Pathak, J., Lu, Z., Hunt, B. R., Girvan, M., & Ott, E.
- Venue
- Chaos: An Interdisciplinary Journal of Nonlinear Science
- Publisher
- AIP Publishing
- Published
- 2017-12-01
- Volume
- 27
- Issue
- 12
- Pages
- 121102-121102
- ISSN
- 1054-1500 (ISSN-L)
- 1089-7682
- OpenAlex
- W2765128778
- Cited by
- 620
- References
- 24
- FWCI
- 24.44
- Type
- journal article
- Language
- en
- Open access
- green
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: Using machine learning to replicate chaotic attractors and calculate Lyapunov exponents from data. https://app.cochat.ai/papers/10.1063/1.5010300
- The paper
- Pathak, J., Lu, Z., Hunt, B. R., Girvan, M., & Ott, E. (2017). Using machine learning to replicate chaotic attractors and calculate Lyapunov exponents from data. Chaos: An Interdisciplinary Journal of Nonlinear Science. https://doi.org/10.1063/1.5010300
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.
