- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes CTEM, a cross-task experience memory framework that maintains shared strategies across an online task stream. Instead of storing each completed trajectory as an independent memory, CTEM links compact strategy items to source trajectory fragments and classifies new evidence as support, refinement, contradiction, uncertainty, or no match. The corresponding relation determines whether the strategy is preserved, revised, qualified with exceptions, or separated into a new memory. Experiments on WebArena and AppWorld show consistent improvements over ReasoningBank and other memory baselines.
Critical strengths
1.The paper studies an important problem in long-running agents: how to update reusable strategies without repeatedly overwriting useful knowledge.
2.The distinction between actor-facing compact strategies and source evidence retained for later revision is intuitive and well motivated.
3.The evaluation covers two different interactive environments and multiple language-model backbones. CTEM-direct also outperforms ReasoningBank, suggesting that the gains are not solely due to query enhancement.
4.The relation-update ablation provides useful evidence that selective refinement is more effective than simply accumulating supporting experiences.
Critical weaknesses
1.The methodological novelty is moderate. Selective memory editing, consolidation, evidence retention, and applicability-aware updates have substantial overlap with prior work such as ExpeL, A-MEM, RecMem, and related experience-memory systems.
2.The evaluation uses the same fixed task order across runs. Since CTEM explicitly relies on cross-task accumulation, performance may depend strongly on which related tasks appear earlier, but task-order sensitivity is not evaluated.
3.The strongest evidence supports support and refinement, while contradiction and uncertainty are extremely rare in the accumulated memory. It is therefore unclear how much these additional relation types actually contribute to the reported improvement.
4.Several components remain entangled. In particular, the current experiments do not isolate the value of source-fragment access from the relation-aware updater itself, nor compare against a generic updater given the same evidence.
5.Reproducibility is incomplete because some important implementation details, including the embedding backend, memory-pipeline model, token limit, and AppWorld memory-reset policy, are not fully specified.
Questions for authors
1.How sensitive are the reported gains to task ordering? Would the relative advantage persist under shuffled or adversarially reordered task streams?
2.Since contradiction and uncertainty account for only a very small fraction of relation records, how much of the full-policy improvement can actually be attributed to these two relations?
3.Can the authors clarify whether source-fragment access itself contributes substantially to performance, independently of relation-aware updating?
4.What memory-reset policy is used across repeated AppWorld evaluations, and could accumulated memory from one evaluation affect another?
5.Can the authors clarify the embedding model and memory-pipeline model used in the reported experiments?