Do reservoir computers work best at the edge of chaos?

被引:52
作者
Carroll, T. L. [1 ]
机构
[1] US Naval Res Lab, Washington, DC 20375 USA
关键词
D O I
10.1063/5.0038163
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
It has been demonstrated that cellular automata had the highest computational capacity at the edge of chaos [N. H. Packard, in Dynamic Patterns in Complex Systems, edited by J. A. S. Kelso, A. J. Mandell, and M. F. Shlesinger (World Scientific, Singapore, 1988), pp. 293-301; C. G. Langton, Physica D 42(1), 12-37 (1990); J. P. Crutchfield and K. Young, in Complexity, Entropy, and the Physics of Information, edited by W. H. Zurek (Addison-Wesley, Redwood City, CA, 1990), pp. 223-269], the parameter at which their behavior transitioned from ordered to chaotic. This same concept has been applied to reservoir computers; a number of researchers have stated that the highest computational capacity for a reservoir computer is at the edge of chaos, although others have suggested that this rule is not universally true. Because many reservoir computers do not show chaotic behavior but merely become unstable, it is felt that a more accurate term for this instability transition is the "edge of stability." Here, I find two examples where the computational capacity of a reservoir computer decreases as the edge of stability is approached: in one case because generalized synchronization breaks down and in the other case because the reservoir computer is a poor match to the problem being solved. The edge of stability as an optimal operating point for a reservoir computer is not in general true, although it may be true in some cases.
引用
收藏
页数:8
相关论文
共 31 条
[1]  
[Anonymous], 2001, GMD TECHNICAL REPORT
[2]   Using a reservoir computer to learn chaotic attractors, with applications to chaos synchronization and cryptography [J].
Antonik, Piotr ;
Gulina, Marvyn ;
Pauwels, Jael ;
Massar, Serge .
PHYSICAL REVIEW E, 2018, 98 (01)
[3]   Permutation entropy: A natural complexity measure for time series [J].
Bandt, C ;
Pompe, B .
PHYSICAL REVIEW LETTERS, 2002, 88 (17) :4
[4]   Rapid time series prediction with a hardware-based reservoir computer [J].
Canaday, Daniel ;
Griffith, Aaron ;
Gauthier, Daniel J. .
CHAOS, 2018, 28 (12)
[5]   Testing dynamical system variables for reconstruction [J].
Carroll, T. L. .
CHAOS, 2018, 28 (10)
[6]  
CRUTCHFIELD JP, 1990, COMPLEXITY ENTROPY P, P223
[7]   Reservoir computing with a single delay-coupled non-linear mechanical oscillator [J].
Dion, Guillaume ;
Mejaouri, Salim ;
Sylvestre, Julien .
JOURNAL OF APPLIED PHYSICS, 2018, 124 (15)
[8]   THE LIAPUNOV DIMENSION OF STRANGE ATTRACTORS [J].
FREDERICKSON, P ;
KAPLAN, JL ;
YORKE, ED ;
YORKE, JA .
JOURNAL OF DIFFERENTIAL EQUATIONS, 1983, 49 (02) :185-207
[9]   Embedding and approximation theorems for echo state networks [J].
Hart, Allen ;
Hook, James ;
Dawes, Jonathan .
NEURAL NETWORKS, 2020, 128 :234-247
[10]   Harnessing nonlinearity: Predicting chaotic systems and saving energy in wireless communication [J].
Jaeger, H ;
Haas, H .
SCIENCE, 2004, 304 (5667) :78-80