Reservoir computing meeting Kolmogorov–Arnold networks: Prediction of high-dimensional chaotic systems

Le résumé fourni par la source

The prediction of high-dimensional chaotic time series is a widely concerned and highly challenging task. We propose a novel method, reservoir computing Kolmogorov-Arnold networks, that combines reservoir computing and Kolmogorov-Arnold networks to address this difficult issue. The proposed method involves replacing the linear output layer of traditional reservoir computing with Kolmogorov-Arnold networks and employs a training scheme that incorporates the teacher-forcing mode and the free-running mode during the training process, respectively. We utilize the multiscale Lorenz-96 system and the Kuramoto-Sivashinsky equation as two examples of high-dimensional chaotic systems to illustrate the feasibility of our method. The results of comparative experiments demonstrate that our method exhibits superior prediction capabilities and maintains robustness in the presence of noise perturbation and hyperparameter variations.

Ce résumé expose les affirmations des auteurs. BNTIC ne l’interprète pas comme une validation indépendante des résultats.