- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper introduces CoReMem to address challenges in long-horizon multi-agent collaboration, including fragmented memory, inconsistent shared states, and the persistence of stale information. This method organizes collaboration history into a shared and versioned graph. When executing a task, an agent retrieves only the local subgraph relevant to the current subtask. When upstream information changes, only the affected downstream components are updated following the established dependency relationships. The authors evaluated their approach across nine benchmarks covering reasoning, coding, and knowledge-based tasks.
Critical strengths
The paper focuses on a meaningful problem. Existing multi-agent memory methods mainly focus on retrieving relevant memories, but less consideration is given to whether the memory remains valid after the upstream information has been corrected. The paper updates memory by using dependency relationships rather than semantic similarity. This provides an insightful perspective.
Critical weaknesses
-
The paper lacks a Related Work section and the comparison with existing work is insufficient. There are many graph-based memory methods for agents like G-Memory [1] , DAMCS [2] and Zep [3], but the paper fails to explain the limitations of these works and why they can not solve the gaps. As a result, the motivation is not well supported.
-
The paper lacks a clear optimization objective. Section 2.4 states the design goal to keep the task correct after changes while reducing retrieval tokens and recovery operations. However, the paper never turns this into a clear objective or trade-off. The memory retrieval is written as a maximization under a budget constraint, but the objective function itself is not clearly defined. As a result, design choices such as retrieval depth, budget, and the mapping from types to operations have no clear basis, and claims like “achieves a better balance” are hard to verify.
-
The experiments do not match the motivation. The motivation is about changes in shared state in long-horizon collaboration. But the experiments mainly use short term tasks such as GSM8K and MMLU. Evaluating on long-horizon tasks such as GAIA and SWE-bench can make the results more convincing.
[1] Guibin Zhang et al. G-Memory: Tracing Hierarchical Memory for Multi-Agent Systems. In Advances in Neural Information Processing Systems (NeurIPS), 2025. [2] Hanqing Yang et al. LLM-Powered Decentralized Generative Agents with Adaptive Hierarchical Knowledge Graph for Cooperative Planning. arXiv preprint arXiv:2502.05453, 2025. [3] Preston Rasmussen et al. Zep: A Temporal Knowledge Graph Architecture for Agent Memory. arXiv preprint arXiv:2501.13956, 2025.
- The writing and experimental details are not clear enough, which reduces reproducibility. The experiments do not state the backbone LLM, do not provide key hyperparameters such as expansion depth and context budget, and do not report the number of runs or the variance.
Questions for authors
-
Please clarify how the key components are implemented. For example, is the Checker that decides whether a repair is valid a programmatic check or a prompt-based LLM?
-
For nodes generated by the LLM, how does the system decide which nodes they depend on? Does it treat all the context retrieved in that step as dependencies, or only the parts that were actually used?
-
What annotations are used to compute the precision and recall of dependency edges in RQ4?