- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper studies bounded memory replacement for LLM systems and proposes EvoMemory. Given a current memory bank and an incoming memory, the method enumerates KEEP and all single-item replacements, producing candidate successor states. During training, these candidates are evaluated on the next examples to construct future-utility supervision for a contextual value model. At deployment, the model predicts candidate utilities without future access and performs a replacement only when its predicted advantage over KEEP exceeds a margin. The method is evaluated on JRE-L and a sequential memory stream constructed from WikiLarge.
Critical strengths
The paper addresses a practically relevant problem: replacement under a fixed memory budget. Contextually valuing complete successor memory states is also intuitively preferable to independently scoring individual memories.
Critical weaknesses
1. Related-work coverage and novelty positioning are insufficient.
The literature coverage is surprisingly limited, especially for recent learned and self-evolving memory-management methods. A particularly concerning omission is the 2025 work “Evo-Memory: Benchmarking LLM Agent Test-time Learning with Self-Evolving Memory,” which studies continuously evolving memory over sequential task streams and even uses essentially the same name, yet is neither cited nor distinguished from this submission. Other closely related learned approaches such as Memory-R1, which learns explicit memory-management operations from downstream outcomes, are also absent. Moreover, although the manuscript itself cites A-MAC, Mem-, and future-utility-based memory-management work, none of these stronger learned approaches is included as an experimental baseline. Consequently, the novelty claim is difficult to assess and appears substantially under-positioned.
2. The method remains fundamentally one-step greedy despite being framed as a sequential decision problem.
The future utility evaluates a single successor bank on the next examples, without rolling out subsequent memory-management decisions. Thus, the method is non-myopic with respect to the evaluation horizon, but remains one-step greedy with respect to the control horizon. A locally preferred successor bank is not guaranteed to be a useful precursor to the globally optimal future memory trajectory. The paper provides no analysis of this approximation, making the sequential-decision framing stronger than what the actual optimization procedure supports.
3. The experimental evidence is too weak to support the claimed generality.
The evaluation is restricted to two benchmarks, one frozen target LLM, and a single stream ordering per benchmark, which the authors themselves acknowledge as limitations. WikiLarge is not originally a memory benchmark and is converted into a synthetic stream of “reusable simplification principles”; JRE-L interactions are likewise converted into abstract memories. The construction of these memories is insufficiently specified and its robustness is not evaluated. The main baselines are also weak—KEEP, FIFO, Similarity, Random, and an LLM-based Importance heuristic—and the only learned item-level control makes no updates under its selected margin, effectively reducing to KEEP. Without stronger learned baselines, multiple stream seeds, and more natural long-term-memory settings, the experiments do not substantiate the main claim.
4. Presentation and reproducibility require substantial improvement.
The manuscript appears insufficiently polished. Figure 1 is difficult to read at normal scale, and central equations are not numbered. More importantly, although the paper states that memory-construction details are provided in the appendices, the appendices largely state that interactions or WikiLarge pairs are converted into abstract memories/reusable principles without sufficiently specifying the model, prompt, and full generation procedure. This makes an important component of the experimental pipeline difficult to reproduce.
Questions for authors
- Could the authors clearly articulate the technical distinction from prior Evo-Memory, Memory-R1, A-MAC, and related learned memory-management approaches, and explain the absence of competitive learned baselines?
- What justifies treating fixed-horizon evaluation of a single successor state as an adequate approximation to the sequential memory-management objective? Have the authors considered an oracle or planning baseline that rolls out subsequent replacement decisions?
- Could the authors provide the complete abstract-memory construction procedure and results across multiple memory-construction settings, stream permutations/random seeds, and stronger learned baselines? These results would materially affect my assessment.