arXiv AI

ELiSe: Efficient Learning of Sequences in Structured Recurrent Networks

The paper introduces ELiSe, a model that leverages cortical network scaffolds and dendritic compartments to learn complex non‑Markovian spatio‑temporal patterns using only local, always‑on, phase‑free synaptic plasticity. It demonstrates the model’s ability to acquire and replay intricate sequences, exemplified by a birdsong learning mock‑up, and shows robustness to external disturbances and flexibility in parameter settings.

arXiv Machine Learning
Jun 25

Frequency Domain Reservoir Computing

arXiv:2606. 24969v1 Announce Type: new Abstract: While the quadratic sequence-length bottleneck of transformers has fueled a resurgence in recurrent models, effectively capturing complex dynamics requires architectures that balance efficient training with highly expressive latent states.

By Klaus Schertler, Xiomara Runge, Andrea Ceni, David Kappel, Claudio Gallicchio
arXiv Machine Learning
Aug 6

Echo Flow Networks

arXiv:2509. 24122v3 Announce Type: replace Abstract: At the heart of time-series forecasting (TSF) lies a fundamental challenge: how can models efficiently and effectively capture long-range temporal dependencies across ever-growing sequences?

By Hongbo Liu, Jia Xu
arXiv Machine Learning
Jul 28

Frequency-Based Reservoir computing

arXiv:2607. 24420v1 Announce Type: cross Abstract: Reservoir computing has emerged as an efficient machine learning framework for predicting time series generated by dynamical systems.

By Arthur S Powanwe
arXiv Machine Learning
Sep 3

Basin Geometry and Reliable Recall of Dynamical Memories in Reservoir Computing

The paper studies how reservoir‑computing associative memories can reliably recall dynamical memories even when their basins of attraction are riddled and unpredictable. It finds that these basins have an octopus‑like shape, with a robust head near the attractor and thin, intertwined tentacles that span state space. By using cue‑driven generalized synchronization, the system bypasses the unpredictable tentacular regions and is driven into the robust basin head, establishing a quantitative link between cue duration, synchronization rate, and basin‑head radius.

By Ling-Wei Kong, Ying-Cheng Lai
arXiv Machine Learning
Jul 28

Numerical Investigation of Sequence Modeling Theory using Controllable Memory Functions

arXiv:2506. 05678v3 Announce Type: replace Abstract: The evolution of sequence modeling architectures, from recurrent neural networks and convolutional models to Transformers and structured state-space models, reflects ongoing efforts to address the diverse temporal dependencies inherent in sequential data.

By Haotian Jiang, Zeyu Bao, Shida Wang, Qianxiao Li
arXiv Machine Learning
Aug 19

Dynamic Compression in Recurrent Networks

Dynamic Compression in Recurrent Networks proposes a method that lets recurrent models revisit and revise their fixed-size state through additional updates, rather than compressing all information in a single causal pass. This approach allows the model to retain lower-fidelity history and refine only the relevant parts when needed, reducing the required state size for accurate task reuse. Experiments show that dynamic compression lowers the recurrent state needed and scales better as the number of stored functions increases.

By Jyothish Pari, Ryan Bahlous-Boldi, Pulkit Agrawal