paper-with-me

홈 › Papers

When to Memorize and When to Stop: Gated Recurrent Memory for Long-Context Reasoning

2026-02-11 · Leheng Sheng, Yongtao Zhang, Wenchang Ma, Yaorui Shi, Ting Huang, Xiang Wang, An Zhang, Ke Shen, Tat-Seng Chua arxiv

While reasoning over long context is crucial for various real-world applications, it remains challenging for large language models (LLMs) as they suffer from performance degradation as the context length grows. Recent work MemAgent has tried to tackle this by processing context chunk-by-chunk in an RNN-like loop and updating a textual memory for final answering. However, this naive recurrent memory update faces two crucial drawbacks: (i) memory can quickly explode because it can update indiscriminately, even on evidence-free chunks; and (ii) the loop lacks an exit mechanism, leading to unnecessary computation after even sufficient evidence is collected. To address these issues, we propose GRU-Mem, which incorporates two text-controlled gates for more stable and efficient long-context reasoning. Specifically, in GRU-Mem, the memory only updates when the update gate is open and the recurrent loop will exit immediately once the exit gate is open. To endow the model with such capabilities, we introduce two reward signals $r^{\text{update}}$ and $r^{\text{exit}}$ within end-to-end RL, rewarding the correct updating and exiting behaviors respectively. Experiments on various long-context reasoning tasks demonstrate the effectiveness and efficiency of GRU-Mem, which generally outperforms the vanilla MemAgent with up to 400\% times inference speed acceleration.

📄 PDF Abstract BibTeX arXiv:2602.10560

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

A comparison of LSTM and GRU networks for learning symbolic sequences

2021-07-05 · Roberto Cahuantzi, Xinye Chen, Stefan Güttel

We explore the architecture of recurrent neural networks (RNNs) by studying the complexity of string sequences it is able to memorize. Symbolic sequences of different complexity are generated to simulate RNN training and…

Memorization

Interacting Attention-gated Recurrent Networks for Recommendation

2017-09-05 · Wenjie Pei, Jie Yang, Zhu Sun, Jie Zhang 외

Capturing the temporal dynamics of user preferences over items is important for recommendation. Existing methods mainly assume that all time steps in user-item interaction history are equally relevant to recommendation, …

Impact of Batch Size on Stopping Active Learning for Text Classification

2018-01-24 · Garrett Beatty, Ethan Kochis, Michael Bloodgood

When using active learning, smaller batch sizes are typically more efficient from a learning efficiency perspective. However, in practice due to speed and human annotator considerations, the use of larger batch sizes is …

Active LearningGeneral ClassificationOpen-Ended Question Answeringtext-classification+1

Diffusion Models Preferentially Memorize Prototypical Examples or: Why Does My Diffusion Model Love Slop?

2026-05-28 · Marta Aparicio Rodriguez, Anastasia Borovykh, Grigorios A. Pavliotis, Daniel J. Korchinski arxiv

Generative models have a persistent limitation: their tendency to memorize training data can create legal liabilities and erode creative diversity. Understanding which samples are memorized in whole or in part, and under…

Tackling Noisy Labels with Network Parameter Additive Decomposition

2024-03-20 · Jingyi Wang, Xiaobo Xia, Long Lan, Xinghao Wu 외

Given data with noisy labels, over-parameterized deep networks suffer overfitting mislabeled data, resulting in poor generalization. The memorization effect of deep networks shows that although the networks have the abil…

Memorization