Learning What to Remember: Long-horizon Counterfactual Memory Optimization
Not on the map. Why?
Abstract (arXiv)
Persistent textual memory allows language models to carry information across long interactions, but learning what to remember is fundamentally a credit-assignment problem. A memory rewrite may only become useful many steps later, while much of the observed utility may be inherited from information already stored before the rewrite. We introduce Memory Gain Policy Optimization (MGPO), which isolates the incremental value of each memory rewrite by crediting it for its marginal contribution to current and future downstream utility. This turns delayed memory utility into a direct learning signal for optimizing what information should persist. We study MGPO on document-level information extraction, where structured supervision makes the effects of individual memory updates directly measurable. MGPO improves extraction while reducing average memory length by nearly 80% relative to the initial memory policy before optimization. The learned memory policy also supports reuse and transfer across domains, downstream models without further training. These results show that effective memory learning depends not only on preserving useful information, but on identifying which memory updates create lasting incremental value.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 42 of its 48 references that are in the map. First posted on arXiv 29 Sep 2026.
Builds on
42 of 48 references.
References · 42
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2025Qwen3 Technical Reportcited by 8,820
- 2023Let's Verify Step by Stepcited by 3,789
- 2025A-MEM: Agentic Memory for LLM Agentscited by 1,063
- 2023Math-Shepherd: Verify and Reinforce LLMs Step-by-step without Human Annotationscited by 928
- 2025Mem0: Building Production-Ready AI Agents with Scalable Long-Term Memorycited by 779
- 2017Counterfactual Multi-Agent Policy Gradientscited by 751
- 2024Phi-4 Technical Reportcited by 711
- 2024LightRAG: Simple and Fast Retrieval-Augmented Generationcited by 315
- 2024Rewarding Progress: Scaling Automated Process Verifiers for LLM Reasoningcited by 279
30 more
- 2025MemAgent: Reshaping Long-Context LLM with Multi-Conv RL-based Memory Agentcited by 246
- 2019DocRED: A Large-Scale Document-Level Relation Extraction Datasetcited by 239
- 2025MEM1: Learning to Synergize Memory and Reasoning for Efficient Long-Horizon Agentscited by 238
- 2025Memory-R1: Enhancing Large Language Model Agents to Manage and Utilize Memories via Reinforcement Learningcited by 237
- 2024BABILong: Testing the Limits of LLMs with Long Context Reasoning-in-a-Haystackcited by 215
- 2022Recurrent Memory Transformercited by 203
- 2018RUDDER: Return Decomposition for Delayed Rewardscited by 173
- 2020Document-Level Relation Extraction with Adaptive Thresholding and Localized Context Poolingcited by 115
- 2020SciREX: A Challenge Dataset for Document-Level Information Extractioncited by 113
- 2020Reasoning with Latent Structure Refinement for Document-Level Relation Extractioncited by 97
- 2019Hindsight Credit Assignmentcited by 79
- 2026Agentic Memory: Learning Unified Long-Term and Short-Term Memory Management for Large Language Model Agentscited by 78
- 2019Connecting the Dots: Document-level Neural Relation Extraction with Edge-oriented Graphscited by 71
- 2020Counterfactual Credit Assignment in Model-Free Reinforcement Learningcited by 64
- 2024CompAct: Compressing Retrieved Documents Actively for Question Answeringcited by 64
- 2018Optimizing Agent Behavior over Long Time Scales by Transporting Valuecited by 58
- 2022Revisiting DocRED -- Addressing the False Negative Problem in Relation Extractioncited by 57
- 2023PRCA: Fitting Black-Box Large Language Models for Retrieval Question Answering via Pluggable Reward-Driven Contextual Adaptercited by 38
- 2023DREEAM: Guiding Attention with Evidence for Improving Document-Level Relation Extractioncited by 37
- 2021Document-level Entity-based Extraction as Template Generationcited by 33
- 2020Learning to Ignore: Long Document Coreference with Bounded Memory Neural Networkscited by 29
- 2019Episodic Memory Reader: Learning What to Remember for Question Answering from Streaming Datacited by 14
- 2026MemPO: Self-Memory Policy Optimization for Long-Horizon Agentscited by 12
- 2025R1-RE: Cross-Domain Relation Extraction with RLVRcited by 11
- 2026Memory-R2: Fair Credit Assignment for Long-Horizon Memory-Augmented LLM Agentscited by 10
- 2026Fine-Mem: Fine-Grained Feedback Alignment for Long-Horizon Memory Managementcited by 8
- 2026Meta-Cognitive Memory Policy Optimization for Long-Horizon LLM Agentscited by 4
- 2026HiMPO: Hindsight-Informed Memory Policy Optimization for Less-Entangled Credit in Long-Horizon Agentscited by 4
- 2024TTM-RE: Memory-Augmented Document-Level Relation Extractioncited by 2
- 2026Decoding the Legalese: A Scalable and Quantitative Framework for Analyzing Corporate Privacy Policiescited by 1
Built on by
Not cited yet.