MemSifter: Offloading LLM Memory Retrieval via Outcome-Driven Proxy Reasoning
Jiejun Tan, Zhicheng Dou, Liancheng Zhang, Yuyang Hu, Yiruo Cheng, Ji-Rong Wen

TL;DR
MemSifter introduces a proxy reasoning framework that offloads memory retrieval from large language models, improving efficiency and accuracy in long-term tasks through reinforcement learning-based optimization.
Contribution
It proposes a novel proxy model approach for memory retrieval in LLMs, reducing computational costs and enhancing retrieval accuracy with RL-based training techniques.
Findings
Outperforms existing methods in retrieval accuracy.
Achieves comparable or better task completion rates.
Requires less computation during indexing and inference.
Abstract
As Large Language Models (LLMs) are increasingly used for long-duration tasks, maintaining effective long-term memory has become a critical challenge. Current methods often face a trade-off between cost and accuracy. Simple storage methods often fail to retrieve relevant information, while complex indexing methods (such as memory graphs) require heavy computation and can cause information loss. Furthermore, relying on the working LLM to process all memories is computationally expensive and slow. To address these limitations, we propose MemSifter, a novel framework that offloads the memory retrieval process to a small-scale proxy model. Instead of increasing the burden on the primary working LLM, MemSifter uses a smaller model to reason about the task before retrieving the necessary information. This approach requires no heavy computation during the indexing phase and adds minimal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Advanced Graph Neural Networks · Information Retrieval and Search Behavior
