- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes an agent memory compression method that deduplicates similar records during agent trajectory generation instead of post-generation summarization, which avoids re-prefilling the context. The deduplication step involves byte-exact hashing to remove exact records in the trajectory, and an embedding similarity-based near-deduplication process to remove similar records in the trajectory and replace them with a retained representative. They also provide a bound on the replacement based on the retrieval scores. Another design choice is about when the compression should occur. They propose to remove the duplicate records when they arrive and before prefilling, which makes the KV cache valid without the re-prefilling cost of summarization-based compression methods. Experiments show that their method removes 22.47% of observation tokens while retaining 99.984% of the measured gold-patch evidence.
Critical strengths
- The idea of applying compression techniques before the records enter the trajectory and get prefilled can reduce computation cost compared to summarization-based methods is valid.
Critical weaknesses
- Poorly written. The paper looks heavily AI-generated, with a lot of AI writing artifacts, and much of the content is hard to follow.
- Lack of novelty. The proposed method looks like engineering tricks rather than a novel research work.
- Insufficient experiments. The evaluation is mostly conducted via proxies rather than end-to-end experiments.
Questions for authors
- Can the authors run end-to-end experiments to report the actual solve rate and behavior change on the compacted context instead of using proxies?
Response to reviews
Dear reviewers,
We thank your valuable suggestions and comments. We agree that two major issues of the submitted paper: lack of end-to-end run and major writting refinement. We will improve the work according to the reviews.
Best,