Metraipolis › archive › dc_543232ef7520

Streaming Recurrent Memory — arXiv:2610.34833

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.34833
License (as archived)
CC0-1.0
Archived
2026-10-27T08:02:19.900Z
SHA-256 of the archived text
21a19b9d2e47c18ae519942373f26aa9fef6dd84db5e38df37241e3daea8bf28
Stable URL of this page
https://metraipolis.com/documento/dc_543232ef7520

How to cite

Streaming Recurrent Memory — arXiv:2610.34833 — arXiv (en), https://arxiv.org/abs/2610.34833 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_543232ef7520 (Metraipolis archive dc_543232ef7520, sha256 21a19b9d2e47c18ae519942373f26aa9fef6dd84db5e38df37241e3daea8bf28)
BibTeX
@misc{dc543232ef7520,
  title = {Streaming Recurrent Memory — arXiv:2610.34833},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.34833},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_543232ef7520; sha256 21a19b9d2e47c18ae519942373f26aa9fef6dd84db5e38df37241e3daea8bf28},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.34833. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Natural intelligence learns from a continuous stream of sensorimotor experience: data can arrive at high bandwidth, and behavior adapts to feedback as soon as it arrives, even when it is delayed. In contrast, most modern deep learning systems rely on stored datasets, replay buffers, and retained contexts through which credit is later assigned. At high data rates, storing and revisiting past experience can be impractical under tight memory and computational constraints. This paper studies recurrent memory under a streaming learning constraint: the learner learns from experience as soon as it arrives without storing raw experience. We ask whether a streaming learner can maintain a state that remains useful for future prediction and control from delayed feedback. We introduce Streaming Recurrent Memory (SRM), a recurrent memory designed for the streaming setting which preserves information that may matter later while remaining trainable with one-step backpropagation through time (BPTT). SRM provides a streaming-compatible recurrence that is designed to recall past information by content or time, track elapsed steps, and compose transformations whose outcome depends on the order in which inputs are observed. Across controlled memory tasks and streaming applications, SRM learns effectively with one-step BPTT, outperforming recurrent baselines in associative recall and online language modeling while achieving near-perfect success in associative T-Maze with delayed rewards. These results suggest that fixing how inputs are stored in the recurrent state, while learning how that state is read out, enables effective streaming learning without long-range backpropagation.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.34833 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-27T07:55:30.943Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).