A tighter generalization bound for reservoir computing

DOI10.1063/5.0082258MaRDI QIDQ6561720zbMATH OpenFDO

Authors Xinyu Han, Yi Zhao, Michael Small

Publication date 25 June 2024

Published in Chaos (Search for Journal in Brave)

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

Mathematics Subject Classification ID

General and miscellaneous specific topics (00Axx) Statistics (62-XX) Artificial intelligence (68Txx)

Cites work

• 10.1162/153244303321897690
• A theory of the learnable
• Foundations of machine learning
• Learning continuous chaotic attractors with a reservoir computer
• Model-free inference of unseen attractors: reconstructing phase space features from a single noisy trajectory using Reservoir computing
• Revisiting the memory capacity in reservoir computing of directed acyclic network
• Simplified PAC-Bayesian margin bounds.
• The Concise Encyclopedia of Statistics
• Understanding machine learning. From theory to algorithms

This page was built for publication: A tighter generalization bound for reservoir computing

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