- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies reuse of key-value caches generated by a sender agent when the receiver agent shares the same model weights and tokenizer but has a different role instruction, interaction history, and token position. Direct reuse avoids re-encoding received messages but is reported to degrade accuracy in a way that varies across models and role pairs. The paper attributes this to three mismatches, namely position shift, magnitude misalignment, and history information conflict, and proposes a training-free framework with three components. RoPE Alignment re-rotates transferred keys to receiver positions, L2-Rescaling scales keys and values toward receiver-local norm statistics, and Dynamic Attention Amplification scales the receiver's instruction keys in dynamically selected heads during decoding. The method is evaluated in a multi-agent debate setting across several models and role pairs, and in a long-horizon deep research agent on two browsing benchmarks. Compared with direct reuse, it recovers accuracy to a level reported as comparable to text communication in the debate setting, and it partially recovers the degradation on the browsing benchmarks, while reducing receiver-side prefill tokens and measured prefill time.
Critical strengths
S1. The paper addresses a practical efficiency problem with a training-free method and measures cost carefully. Repeated re-encoding of received messages is a real cost in multi-agent pipelines, and adapting existing caches without modifying weights is easy to adopt in principle. The cost accounting separates processed prefill tokens from cache hits, includes the adaptation overhead in prefill time, and reports end-to-end timing in the appendix, including a pair where the method is slower. This makes the efficiency claims more interpretable, which matters because the contribution is ultimately a quality-efficiency trade-off.
S2. The evaluation extends beyond controlled debate to a long-horizon agentic setting and includes an honest analysis of its limits. The appendix uses teacher-forced probes and partial recomputation to show that the discrepancy is present before trajectories diverge and is not confined to the end of the message. This clarifies where cache adaptation can and cannot help, and supports a more realistic reading of the results than the debate setting alone.
Critical weaknesses
W1. The positioning against closely related training-free methods is not supported empirically, and the novelty of individual components is unclear. The central claim concerns a better quality-efficiency trade-off for cross-context KV reuse, yet the main comparison includes only text communication and unadapted direct reuse. KVCOMM (Ye et al., 2025) addresses the same problem of reusing KV caches under diverging agent prefixes without training, but it is not evaluated as a baseline. RelayCaching (Geng et al., 2026) also reuses decoding-phase KV caches of a previous agent in the next agent's prefill, relying on selective recomputation, and is not cited. Its observation that prefix-induced deviations are localized appears to differ from the finding in Appendix J that tail recomputation gives only partial recovery, which makes a direct comparison informative. As a result, the limitations of prior work are shown only against a naive baseline, and it is not clear whether the proposed adaptation improves over existing alternatives. In addition, the components resemble existing ideas that are not discussed. L2-Rescaling is related to the scaling and temperature alignment used for reused KV states in APE (Yang et al., 2025), and Dynamic Attention Amplification is related to instruction-focused attention steering in selected heads such as PASTA (Zhang et al., 2024) and SpotLight (Venkateswaran & Contractor, 2026). The three mismatches are motivated mainly by a schematic (Figure 3), and Appendix C states that the diagnostic identities characterize possible sources rather than measured contributions. Together, these points make it hard to judge what is new and what is responsible for the reported gains, which is central to the significance of the contribution.
W2. The evidence for quality comparable to text communication is weaker than the headline numbers suggest. The macro-averaged accuracy of 65.44% versus 64.88% for text appears to be driven largely by one model, where the proposed method improves over text by 5.33 points (72.54% versus 67.21%). On two of the other three models the method remains below text (57.46% versus 58.39%, and 51.68% versus 54.36%), and on WebSailor it stays below text on both BrowseComp-EN and BrowseComp-ZH (28.33% versus 34.67%, and 33.33% versus 40.00%). The evaluation scale also limits how reliably such differences can be interpreted. Each ordered role pair uses 50 questions, the component ablation and the head-selection comparison (Tables 3 and 4) rely on 4 to 12 role pairs, and the gain of dynamic selection in Table 4 comes mostly from two pairs. The hyperparameters are tuned on a development set whose size and overlap with the few-shot examples are unclear. Since the paper's conclusion rests on recovering text-level quality while saving prefill cost, these issues make it difficult to tell whether the reported recovery is robust or specific to certain models and role pairs.
Questions for authors
Q1. Direct reuse matches or exceeds text communication on Ministral-3-3B in many role pairs (Figure 2), whereas it degrades on the other models, and Appendix H does not analyze this model. I wonder what accounts for this difference. It would be helpful to see the rate of invalid final answers, which are counted as incorrect, for each method and model, and whether the longer messages implied by the text prefill counts for this model play a role. I also noticed that the Direct KV accuracy in Table 5 appears identical for Qwen2.5-3B and LLaMA3.2-3B, and it would be good to confirm that this is not a copy error.
Q2. The proposed method exceeds text communication in some settings where direct reuse does not degrade (e.g., the Ministral results and Table 4), which makes me wonder whether Dynamic Attention Amplification repairs cache mismatch or mainly increases attention to instructions in general. It would be helpful to see Dynamic Attention Amplification and L2-Rescaling applied to text communication where no foreign cache is inserted. It would also be helpful to report the fraction of heads selected per layer under the chosen threshold, the sensitivity to the gain and threshold, and the data split used to tune them. Since the amplification scales signed logits (Appendix D), I am curious how often it lowers attention for the selected heads because the query-key product is negative.
Q3. The three mismatches are motivated mainly by the schematic in Figure 3. I wonder whether they can be connected to measured quantities, for example by relating the degradation of Direct KV to the sender-receiver prefix length difference, and by measuring the norm gap relative to receiver-native re-encoded message states rather than receiver prompt statistics. The benefit of L2-Rescaling differs substantially across models, so I am curious whether the magnitude gap itself differs across models and whether architectural details such as query-key normalization or projection biases are relevant.
Q4. The method assumes that the sender and receiver share identical weights and tokenizer. I wonder how common this setting is in practical multi-agent deployments, where agents are often backed by different model sizes or fine-tuned variants of a shared base model. It would be helpful to see whether the proposed components remain effective for fine-tuned variants of the same base model, and to discuss what would be required to extend the approach beyond a single model. This is offered as a suggestion rather than a requirement.
Q5. The introduction describes the message-prefill computation as reduced from quadratic to linear in the number of agents, but the RoPE Alignment and L2-Rescaling steps appear to be applied per message and receiver pair. I am curious how the adaptation overhead scales with the number of agents in the fully connected setting. In addition, the prefill time reduction in Table 2 shrinks considerably in the end-to-end timing of Appendix E.2, with one pair becoming slower, and it would be helpful to know how the timed pairs were selected and to see end-to-end timing for the WebSailor experiments.