- Rating
- 3
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a comprehensive architecture integrating KV-level reversible context management, isolated memory selection, and training replay. The method decouples memory management from task execution and further implements RoPE positional adaptation, CPU offloading, parallel training replay, and gradient propagation. Its effectiveness is validated via extensive experiments on memory benchmark, agent benchmark, system throughput evaluation, ablation studies, and OPD training verification.
Critical strengths
- The motivation is clear, and the problem is practical. The paper addresses two limitations in existing long-horizon agent memory management: summary compression tends to discard critical information; memory retrieval requires repeated prefill. The proposed reversible KV management resolve both limitations.
- The method is well-designed. ReTurn integrates KV restoration, RoPE position adaptation, CPU offloading and Ephemeral Probe. It also decouples memory management operations from official task trajectories. This avoids extra management tokens interfering with agent execution and reduces the complexity of training adaptation.
- ReTurn proposed Path-aware Parallel Replay reconstructs dynamic contexts at different timesteps and enables gradient propagation over reused KV states. It works not only for inference but also for OPD training.
- The experiments are relatively comprehensive.
Critical weaknesses
- KV reuse lacks sufficient analysis of its effective boundary: historical KV is computed under the original context, but when restored, the context and positions may have changed, and adjusting RoPE alone can't fully fix this.
- Training experiments are insufficient: results only show ReTurn makes OPD training feasible with performance gains, but lack direct comparison to full-context OPD and systematic analysis of Parallel Replay's training overhead.
Questions for authors
- ReTurn reuses historical KV states by directly remapping RoPE positions. While this effectively reduces computational overhead, does significant performance degradation occur when the reused historical KV differs substantially from the current context (there is weak correlation between the restored KV)? Could you provide a case study comparing actual outputs in such scenarios?
- What is the additional training cost of Path-aware Parallel Replay? Compared with standard full-context training, what are its training throughput, peak memory usage and total computational overhead? Besides, the proposed method introduces complexity, and it remains unclear whether it can be stably applied to training at scale for long-horizon tasks.
- ReTurn lacks discussion and ablations on its triggering mechanism. Agent tasks vary in their reliance on historical context, and probing at every turn may introduce extra overhead, especially for simpler tasks. A more adaptive triggering strategy could improve its practical usage.
- Adding more discussions on related methods for context compression and KV reuse is beneficial. Summarizing their pros and cons can help better evaluate the novelty and effectiveness of this work.
2 comments
Thank you for the detailed rebuttal. It addresses most of my concerns, and I will maintain my positive rating.
Q3. Triggering mechanism
The probe is already conditional rather than unconditional. It runs only when folding is enabled and something has actually been folded, so on short trajectories, and on the early turns of every trajectory, no probe fires at all. In sample 135 above, 110 probes run across 114 assistant turns because that trajectory folds early and often, but a task whose history never exceeds the active window never pays for a probe.
Beyond this condition the probe fires on every turn, and we think you have identified one of the more promising directions for this line of work. The interesting question is not only how to save the cost of an unnecessary probe, but when restoration is needed at all. Trajectories differ a great deal in this respect. Some, like the one above, repeatedly return to evidence found a hundred turns earlier, while others never look back and would be served just as well with no restoration. A method that could recognize which regime it is in, and switch probing on and off accordingly, would be more useful than our fixed policy, and would also tell us something about how agents actually use their history.
We are taking this up as the direction of our next piece of work. Rather than hand-tuning a rule, we want the policy to be learned: a model that decides at each step whether a probe is needed, trained together with the probe itself so that its selections also become more accurate. We will say this in the paper, both as a limitation of the present design and as what we intend to build on it.
Q4. Discussion of related context compression and KV reuse methods
We will expand Section 5 of the paper with a structured comparison.
Why RETURN does not need the repair that CacheBlend and KVLink require. CacheBlend and KVLink are both KV reuse methods, and both report that naively concatenating reused KV degrades quality, so each adds a mechanism to recover it. CacheBlend selectively recomputes the KV of a subset of tokens, and KVLink trains link tokens and adjusts positions to restore the missing interaction. The degradation they repair comes from how their caches are built. In the RAG setting each context paragraph is prefilled separately, so the KV of one paragraph is computed without ever attending to the others, and the cross-paragraph dependencies are simply absent from the cache. RETURN starts from a different position. Every turn of an agent trajectory is encoded inside one continuous context, where it attends to the earlier turns that were active when it was produced, so the dependencies between turns are already written into the stored KV. Restoration brings these states back in chronological order and only has to adapt their positions, which is why Figure 3 shows restored history reaching the full-context level without any recomputation or trained linking.
We thank the reviewer for these questions. Several identified reporting gaps rather than defects in the method, and addressing them has made the training and boundary analysis more complete.