arrow
Return

Parallelizable memory recurrent units

delete2026-10-23
delete0
delete
OA
AI
F
Florent De Geeter *
G
Gaspard Lambrechts
D
Damien Ernst
G
Guillaume Drion
DOI:10.1016/j.neunet.2026.109797delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
With the emergence of massively parallel processing units, parallelization has become a desirable property for new sequence models. The ability to parallelize the processing of sequences with respect to the sequence length during training is one of the main factors behind the uprising of the Transformer architecture. However, Transformers lack efficiency at sequence generation, as they need to reprocess all past timesteps at every generation step. Recently, state-space models (SSMs) emerged as a more efficient alternative. These new kinds of recurrent neural networks (RNNs) keep the efficient update of the RNNs while gaining parallelization by getting rid of nonlinear dynamics (or recurrence). SSMs can reach state-of-the-art performance through the efficient training of potentially very large networks, but still suffer from limited representation capabilities. In particular, SSMs cannot exhibit persistent memory, or the capacity of retaining information for an infinite duration, because of their monostability. In this paper, we introduce a new family of RNNs, the memory recurrent units (MRUs), that combine the persistent memory capabilities of nonlinear RNNs with the parallelizable computations of SSMs. These units leverage multistability as a source of persistent memory, while getting rid of transient dynamics for efficient computations. We then derive a specific implementation as proof-of-concept: the bistable memory recurrent unit (BMRU). This new RNN is compatible with the parallel scan algorithm. We show that BMRU achieves good results in tasks with long-term dependencies, and can be combined with SSMs to create parallelizable hybrid networks that have both transient dynamics and persistent memory.
Keywords:
memory
multistability
parallelization
recurrent neural network
surrogate gradient

Journal

Neural Networks cover
Neural Networks
IF:
6.3
Papers:
8.3K
Citations:
3.5W

Organization

U
university of liège
Scholars:
483
Papers: 201
Citations: 2.1K
Cited Papers

Cited Papers

Learning Finite State Machines With Self-Clustering Recurrent Networks
err1993-11-01
err0
errOAAI
errZheng Zeng; Rodney M. Goodman; Padhraic Smyth
errShare
errSave
Long Short-Term Memory
err1997-11-01
err0
PREAI
errSepp Hochreiter; Jürgen Schmidhuber
errShare
errSave
Theory of Gating in Recurrent Neural Networks
err2022-01-18
err20
errOAAI
errKrishnamurthy, Kamesh; Can, Tankut; Schwab, David J.
errShare
errSave
Gradient-based learning applied to document recognition
err1998-01-01
err3.8W
PREAI
errLecun, Y; Bottou, L; Bengio, Y; Haffner, P
errShare
errSave
Multistability in Recurrent Neural Networks
err2006-01-01
err0
PREAI
errChang-Yuan Cheng; Kuang-Hui Lin; Chih-Wen Shih
errShare
errSave
A bio-inspired bistable recurrent cell allows for long-lasting memory
err2021-06-08
err0
errOAAI
errNicolas Vecoven; Damien Ernst; Guillaume Drion
errShare
errSave
Recurrent neural network from adder's perspective: Carry-lookahead RNN
err2021-12-01
err21
errOAAI
errJiang, Haowei; Qin, Feiwei; Cao, Jin; Peng, Yong; Shao, Yanli
errShare
errSave
researcher View more