arXiv:2508. 21172v3 Announce Type: replace-cross Abstract: Echo State Networks (ESNs) are a particular type of untrained Recurrent Neural Networks (RNNs) within the Reservoir Computing (RC) framework, popular for their fast and efficient learning.
By Matteo Pinna, Andrea Ceni, Claudio Gallicchio
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: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:2606. 28380v1 Announce Type: cross Abstract: The intricate structures of biological neural networks largely emerge during development, guided by a comparatively compressed blueprint encoded in the genome.
By Mani Hamidi, Sina Khajehabdollahi, Charley M. Wu, Emmanouil Giannakakis
arXiv:2607. 02283v1 Announce Type: cross Abstract: In-context learning (ICL) operates via implicit gradient descent embedded in the forward pass of modern AI architectures -- Transformers, Mamba, state-space models, and MLPs.
By Juwei Shen, Yujie Wu, Changwen Chen
arXiv:2602. 01196v2 Announce Type: replace Abstract: Recurrent neural policies are widely used in partially observable control and meta-RL tasks.
By Jin Li, Yue Wu, Mengsha Huang, Yuhao Sun, Hao He, Xianyuan Zhan
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
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:2608. 04358v1 Announce Type: new Abstract: Continual learning (CL) requires models to learn tasks sequentially, yet deep neural networks often suffer from plasticity loss and poor knowledge transfer, which can impede their long-term adaptability.
By Seyed Roozbeh Razavi Rohani, Khashayar Khajavi, Wesley Chung, Mandana Samiei, Mo Chen
arXiv:2609.16752v1 Announce Type: new
Abstract: Cognitive Field Theory (CFT) proposes that cognition arises from memory-dressed collective dynamics that generate a persistent macroscopic cognitive fi...
By Byung Gyu Chae
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
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