SHARP: Sleep-based Hierarchical Accelerated Replay for Long Range Non-Stationary Temporal Pattern Recognition
Not on the map. Why?
Abstract (arXiv)
Learning long-range non-stationary temporal patterns remains a core challenge for modern sequence models, particularly in strict streaming settings. In these settings, data arrive sequentially and must be processed in a single pass without simultaneously revisiting past observations. Standard architectures, including recurrent neural networks and transformers, are constrained by either truncated backpropagation through time horizon or explicit input window length for long range credit assignment. To address these limitations, we propose SHARP (Sleep-based Hierarchical Accelerated Replay), a framework that decomposes temporal learning into two complementary components: a memory module that accumulates a structured history of past inputs, and a pattern-recognition module that operates over this memory. This separation enables resource- and compute-efficient adaptation to non-stationary dynamics by eliminating the need for backpropagation through time across many steps for long-range credit assignment. Inspired by the accelerated replay observed in rodents during slow-wave sleep, SHARP incorporates offline (sleep) phases in which temporally structured memory traces are replayed in an accelerated form and integrated into higher-level memory representations, improving long-range context retention. Through controlled simulations and ablation studies, we characterize the key properties of the proposed framework. In benchmark datasets such as text8 and PG-19, we demonstrate that SHARP improves over recurrent baselines by retaining next-token predictive performance on previously seen data while continuing to learn from the current stream and generalizing to future unseen data. These gains are enabled by its hierarchical structure, which yields an exponentially increasing effective temporal context with only linear-time computational cost.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 41 references that are in the map. First posted on arXiv 30 May 2026.
Builds on
23 of 41 references.
References · 23
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Neural Discrete Representation Learningcited by 4,650
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
- 2016Learning without Forgettingcited by 2,465
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,286
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2019Generating Diverse High-Fidelity Images with VQ-VAE-2cited by 1,376
- 2017Continual Learning with Deep Generative Replaycited by 1,152
- 2018Experience Replay for Continual Learningcited by 1,074
11 more
- 2018Efficient Lifelong Learning with A-GEMcited by 1,044
- 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
- 2019Compressive Transformers for Long-Range Sequence Modellingcited by 699
- 2016Using Fast Weights to Attend to the Recent Pastcited by 161
- 2016Hierarchical Multiscale Recurrent Neural Networkscited by 102
- 2020A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrixcited by 99
- 2014A Clockwork RNNcited by 70
- 2025The Curse of Depth in Large Language Modelscited by 58
- 2023SIESTA: Efficient Online Continual Learning with Sleepcited by 24
- 2020Simple Lifelong Learning Machinescited by 9
- 2026Position: Modular Memory is the Key to Continual Learning Agentscited by 7
Built on by
Not cited yet.