- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces Learnable Memory Injection (LMI), a post-retrieval memory-injection module placed between memory retrieval and model inference. It addresses two limitations of existing approaches: injecting all retrieved candidates introduces substantial contextual redundancy, while selecting memories solely according to individual relevance may omit complementary evidence required by the task. LMI extracts task requirements and source-traceable facts from the query and candidate memories, constructs a task–memory relation graph, and jointly selects complete memory items according to the task-relevant information missing from the current selection under item-count and token-budget constraints. It further trains a context-dependent utility scorer using downstream performance differences observed when individual memories are removed and organizes the selected memories using a fixed context template. Experiments on LongMemEval and LoCoMo with Qwen2.5-7B, Llama-3.1-8B, and GPT-5 show that LMI generally maintains or improves answer accuracy while substantially reducing the number of injected memory tokens.
Critical strengths
Structured and interpretable selection mechanism: LMI constructs source-traceable task–memory relations and selects memories according to their marginal coverage of missing information. This design is more interpretable than purely embedding-based ranking and preserves the original memory text for provenance.
Strong empirical effectiveness and efficiency: LMI is evaluated across two benchmarks and three LLM backbones. It generally improves answer accuracy while substantially reducing injected memory tokens; for example, Llama-3.1-8B improves from 64.6% to 77.8% on LongMemEval Top-200 while using 83.9% fewer memory tokens.
Critical weaknesses
The methodological novelty is limited. Graph-based retrieval and reasoning, requirement-aware context filtering, budgeted set-dependent selection, and feedback-based utility estimation have all been explored in prior work adaptive memory-routing systems. Some woud combine these established components into a post-retrieval memory-injection pipeline. Although the source-linked requirement–fact graph provides an interpretable implementation, the paper does not clearly demonstrate that it constitutes a fundamentally new selection principle rather than a task-specific reformulation of existing coverage-based context selection.
Questions for authors
see weakness