Search arXivSearch

arXiv · 2601.21807

Ensemble Reservoir Computing for Physical Systems

Abstract

Physical computing exploits unconventional physical substrates to overcome limitations such as the high energy consumption inherent in digital computation. However, intrinsic noise and temporal fluctuations (e.g., oscillations) generally deteriorate computational performance. Here, we propose ensemble reservoir computing (ERC), a novel framework that employs ensemble averaging of spatially multiplexed systems to achieve robust information processing despite noise and temporal fluctuations. First, we prove that ensemble averaging in ERC eliminates temporal fluctuations and noise from dynamical states under certain conditions, thereby restoring computational performance to its noise-free level. Next, we show that ERC not only removes the noise and fluctuations but also actively exploits the computational capabilities that conventional reservoir computing (RC) leaves unutilized. This computational enhancement is demonstrated across diverse dynamical systems (e.g., periodic, chaotic, and strange-nonchaotic systems), in which ERC outperforms conventional RC. Finally, using energy-efficient spin-torque oscillators (STOs), we demonstrate that ERC maintains high performance even under realistic conditions, in which noise and temporal fluctuations coexist: STOs with ERC achieved 99\% accuracy on an error detection test, where conventional STO reservoir with linear regression only shows a chance level performance, highlighting ERC's robustness and performance gains for physical systems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuma Nakamura, Tomoyuki Kubota, Yusuke Imai, Sumito Tsunegi, Hirofumi Notsu, Kohei Nakajima. 2026-01-29. Ensemble Reservoir Computing for Physical Systems. https://arxiv.org/abs/2601.21807

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS