- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper studies whether a main agent can directly reuse the KV cache that a subagent computed for its returned conclusion, framed as partial-segment position-independent caching (PIC). The method builds a vLLM-based serving system that grafts the subagent response KV into the main agent's prompt with RoPE rebasing and without recomputation, based on the observation that an interior span carries no attention sink. The paper evaluates reuse at three levels: a Retell test that reproduces the grafted notes, a QA diagnostic on the final chunk of a long context, and a deep-research workflow with multiple subagents per turn. The results show that single-span reuse stays within single-digit F1 of full prefill, while quality degrades as the number of reused spans grows.
Critical strengths
- The paper addresses a concrete and practically relevant question. Since subagent outputs are produced by the same model, their KV cache already exists, and the paper builds an end-to-end path to examine its reuse in a real agent loop. The exact-prefix boundary tracking, which keeps grafted approximate states from being treated as exact prefix hits in later rounds, is a careful design detail for cross-agent reuse.
Critical weaknesses
-
(Originality / Quality) The central explanation that an interior span needs no recomputation because it has no attention sink is not directly validated, and its relation to prior work on the same setting could be clarified.
a. Reusing a sender's generated-response KV has been studied in KVCOMM [1] and RelayCaching [2], both of which introduce correction because direct reuse affects the receiver's quality. It would be helpful to discuss why the conclusion here differs.
b. The role of the attention sink is not isolated, for example by comparing the same span with and without its leading tokens, or against EPIC/CacheBlend-style repair at matched cost. KV Repair is disabled without reported numbers.
c. The high single-span scores may also be related to the probe design, since Retell is close to verbatim copying and the QA questions concern the span's own content.
d. In Agent-Trace, the gap reaches 7.98–13.14 pp at for the Qwen models. Since each grafted span's KV is computed without access to the other spans or the main agent's context, this degradation appears close to the missing cross-chunk attention addressed by CacheBlend [3], rather than a still-uncharacterized obstacle. The conclusion that it is not caused by the sink would be more convincing once the sink explanation of the single-span case is established.
-
(Quality) Some experiment settings may not fully reflect the intended counterfactual, and a few settings are difficult to reconcile with the described system.
a. In KVCache-QA, the reuse condition keeps only the final chunk's KV while the baseline prefills all chunks. Since a main agent would prefill only the returned text, the gap may reflect both context removal and cache mismatch.
b. In Agent-Trace, the number of subagents also changes the fraction of the prompt occupied by approximate states, which makes it difficult to separate an aggregation effect from the amount of reused KV.
c. The appendix states that one delegation is executed per main turn, while the main results vary up to 9 subagents per turn.
d. The appendix describes the backend as supporting dense Qwen3 with full attention, while the results include MoE (Qwen3-30B-A3B) and MLA (GLM-4.7-Flash) models, and Figure 4 notes missing or mismatched GLM records. Clarifying these points would help confirm the reported numbers.
[1] H. Ye et al. KVCOMM: Online Cross-context KV-cache Communication for Efficient LLM-based Multi-agent Systems. NeurIPS, 2025.
[2] Y. Geng et al. RelayCaching: Accelerating LLM Collaboration via Decoding KV Cache Reuse. arXiv:2603.13289, 2026.
[3] J. Yao et al. CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion. EuroSys, 2025.
Questions for authors
-
(ref Weakness 1) Could the authors test the attention-sink explanation more directly, for example by reusing the same span with and without its leading tokens, or by applying EPIC/CacheBlend repair at matched cost? How do the findings relate to KVCOMM and RelayCaching in the same setting?
-
(ref Weakness 1) Would cross-span recomputation, as in CacheBlend, recover the multi-span gap? This would help clarify whether the aggregation obstacle is indeed a new phenomenon.
-
(ref Weakness 2) What is the score of a KVCache-QA baseline that prefills only the final chunk with the question?
-
(ref Weakness 2) Could the authors clarify how subagents per turn are executed given the one-delegation-per-turn description, which backend produced the MoE and MLA results, and whether per-query records for GLM are available?
-
(ref Weakness 2) Does the multi-span gap remain when the total number of grafted tokens is fixed while varies?
-
(Clarification) Since segmented prefill issues one internal request per gap, how much end-to-end prefill time is saved compared with exact-prefix reuse and suffix prefill?
-
(Presentation, minor) It would help to describe how RoPE rebasing is applied under MLA, where only the decoupled RoPE key is rotated. The description of the null KV Repair stage is also repeated across Sections 3 and 4.
Thank you for the response and the clarifications.
The concerns on the probe design and the amount of approximate KV are partially addressed, as the supporting evidence comes from single-span settings that do not test the multi-span confound. The clarifications on the k-delegation workflow, the RoPE treatment under MLA, the GLM records, and the repeated text are helpful.
Some of my main concerns still remain, since the response narrows the central claims without providing new evidence. If the attention sink is presented as a hypothesis, the conclusion that the aggregation gap is not caused by the sink may also need to be softened. Similarly, attributing the gap to missing cross-span attention, together with the observation that RelayCaching's Zero Reuse results show a similar pattern, suggests that the contrast between single-span and multi-span reuse may have been partly reported before. It would be helpful to clarify what new understanding the paper adds beyond this. In addition, the final-chunk-only baseline and the fixed-token control are not yet provided. Without them, it remains somewhat difficult to attribute the KVCache-QA gap and the Agent-Trace degradation. Since the subagent also receives task context from the main agent (Appendix A.1), the k=1 case may not fully separate attention to the receiving context from attention between spans. Lastly, as latency is not measured, the efficiency motivation of the paper could be better supported with wall-clock results.
I appreciate the authors' clarification, but I will keep my current assessment.