Reservoir computing with the minimum description length principle

DOI10.1063/5.0252938MaRDI QIDQ6941023zbMATH OpenFDO

Authors Antony Mizzi, Michael Small, David M. Walker

Publication date 19 August 2025

Published in Chaos (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1063/5.0252938

Mathematics Subject Classification ID

Ordinary differential equations (34-XX) Dynamical systems and ergodic theory (37-XX)

Cites work

• A new look at the statistical model identification
• Breaking symmetries of the reservoir equations in echo state networks
• Estimating the dimension of a model
• Fading memory and the problem of approximating nonlinear operators with Volterra series
• scientific article; zbMATH DE number 1866304 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• IMPROVED PARAMETER ESTIMATION FROM NOISY TIME SERIES FOR NONLINEAR DYNAMICAL SYSTEMS
• Modeling by shortest data description
• On explaining the surprising success of reservoir computing forecaster of chaos? The universal machine learning dynamical system with contrast to VAR and DMD
• On selecting models for nonlinear time series
• Re-visiting the echo state property
• Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations
• REFINEMENTS TO MODEL SELECTION FOR NONLINEAR TIME SERIES
• Reservoir Computing
• Using machine learning to replicate chaotic attractors and calculate Lyapunov exponents from data

This page was built for publication: Reservoir computing with the minimum description length principle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941023)