共 50 条
Reservoir computing with logistic map
被引:0
|作者:
Arun, R.
[1
]
Aravindh, M. Sathish
[1
,2
,3
]
Venkatesan, A.
[4
]
Lakshmanan, M.
[1
]
机构:
[1] Bharathidasan Univ, Sch Phys, Dept Nonlinear Dynam, Trichy 620024, India
[2] Indian Inst Technol Madras, Dept Aerosp, Chennai 600036, India
[3] Indian Inst Technol Madras, Ctr Excellence Studying Crit Transit Complex Syst, Chennai 600036, India
[4] Bharathidasan Univ, PG & Res Dept Phys, Nehru Mem Coll Autonomous, Puthanampatti 621007, India
关键词:
NEURAL-NETWORKS;
D O I:
10.1103/PhysRevE.110.034204
中图分类号:
O35 [流体力学];
O53 [等离子体物理学];
学科分类号:
070204 ;
080103 ;
080704 ;
摘要:
Recent studies on reservoir computing essentially involve a high-dimensional dynamical system as the reservoir, which transforms and stores the input as a higher-dimensional state for temporal and nontemporal data processing. We demonstrate here a method to predict temporal and nontemporal tasks by constructing virtual nodes as constituting a reservoir in reservoir computing using a nonlinear map, namely, the logistic map, and a simple finite trigonometric series. We predict three nonlinear systems, namely, Lorenz, R & ouml;ssler, and Hindmarsh-Rose, for temporal tasks and a seventh-order polynomial for nontemporal tasks with great accuracy. Also, the prediction is made in the presence of noise and found to closely agree with the target. Remarkably, the logistic map performs well and predicts close to the actual or target values. The low values of the root mean square error confirm the accuracy of this method in terms of efficiency. Our approach removes the necessity of continuous dynamical systems for constructing the reservoir in reservoir computing. Moreover, the accurate prediction for the three different nonlinear systems suggests that this method can be considered a general one and can be applied to predict many systems. Finally, we show that the method also accurately anticipates the time series of the all the three variable of R & ouml;ssler system for the future (self-prediction).
引用
收藏
页数:12
相关论文