SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2412.09800 · 2024

Infinite-dimensional next-generation reservoir computing

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 5 functions out of this paper's own repositories and ran 0 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
learning-of-dynamic-processes/kernelngrcvolterra canonical 0 of 5
FunctionStatusWhere it lives
data_iterate Not yet run learning-of-dynamic-processes/kernelngrcvolterra/datagen/data_generate_discrete.py
pointer only (licence: NONE) · get_code("7fc48280ae857097")
dde_rk45 Not yet run learning-of-dynamic-processes/kernelngrcvolterra/datagen/data_generate_dde.py
pointer only (licence: NONE) · get_code("9795de0afabde4dd")
iter_rk45 Not yet run learning-of-dynamic-processes/kernelngrcvolterra/datagen/data_generate_dde.py
pointer only (licence: NONE) · get_code("80b7315f3f84958c")
iter_rk45 Not yet run learning-of-dynamic-processes/kernelngrcvolterra/datagen/data_generate_ode.py
pointer only (licence: NONE) · get_code("26addaaf66b67343")
rk45 Not yet run learning-of-dynamic-processes/kernelngrcvolterra/datagen/data_generate_ode.py
pointer only (licence: NONE) · get_code("e8ff56409e41f4bd")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Next-generation reservoir computing (NG-RC) has attracted much attention due to its excellent performance in spatio-temporal forecasting of complex systems and its ease of implementation. This paper shows that NG-RC can be encoded as a kernel ridge regression that makes training efficient and feasible even when the space of chosen polynomial features is very large. Additionally, an extension to an infinite number of covariates is possible, which makes the methodology agnostic with respect to the lags into the past that are considered as explanatory factors, as well as with respect to the number of polynomial covariates, an important hyperparameter in traditional NG-RC. We show that this approach has solid theoretical backing and good behavior based on kernel universality properties previously established in the literature. Various numerical illustrations show that these generalizations of NG-RC outperform the traditional approach in several forecasting applications.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2412.09800")
get_code_for_paper("2412.09800")
have("2412.09800")

Connect an agent — have() is free.