- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper addresses the challenges of inference cost and efficiency associated with long-term memory in long-context LLM agents. We propose the ARKA framework, which employs a lightweight router to adaptively select an appropriate memory access policy based on the current query—such as fact lookup, dialogue window retrieval, example retrieval, or full-context reading. The framework organizes historical information into distinct "memory views" and utilizes predefined retrieval and processing operations to construct a streamlined working context on the CPU, thereby reducing both the number of input tokens and the inference overhead for the backbone LLM. Experiments conducted across various LLM backbones and memory benchmarks demonstrate that ARKA can maintain or even improve response quality on certain tasks, while significantly lowering inference costs and reducing the VRAM (video memory) footprint typically incurred by long-context processing.
Critical strengths
This paper addresses the issue of memory access efficiency in long-context agents. The research motivation is clear.
Experiments were conducted across various LLM backbones and memory benchmarks. The results demonstrate that the proposed method effectively reduces input token counts and inference overhead, while maintaining strong performance on certain tasks.
Critical weaknesses
The method lacks sufficient innovation. The proposed ARKA framework essentially employs a lightweight MLP to classify predefined Memory Access Policies, subsequently constructing the context by combining BM25 retrieval with manually designed rules. The overall approach is quite similar to existing Adaptive RAG and Memory Routing methods; it primarily functions as a combination and system-level integration of established techniques, lacking significant technical novelty. Furthermore, the router relies on predefined labels for supervised training rather than optimizing the Memory Access Policy based on feedback from downstream tasks. Consequently, it fails to fully demonstrate the distinct advantages that a learned routing mechanism might offer over simple, rule-based approaches.
There is a lack of comprehensive comparison with existing, mainstream memory-based methods. The current experiments are limited to a few baselines—such as Full Context, LLMLingua-2, and A-Mem—and omit systematic comparisons with other representative agent memory methods, including MemoryBank, LightMem, Mem0, MemoryOS, MemP, and LangMem. Notably, BudgetMem (presented at ICML 2026)—which also explores query-aware memory routing and utilizes reinforcement learning to optimize the trade-off between task performance and computational cost—is highly relevant to the objectives of this paper. Although the authors cite BudgetMem in the "Related Work" section, they do not provide a direct experimental comparison. It is recommended to include these baselines—specifically BudgetMem—using the same benchmarks, backbones, and computational budgets to more robustly validate the effectiveness and innovation of the proposed method.
Questions for authors
Please see above.