- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper studies how LLM agents in multi-agent systems could communicate through their internal states instead of text. They compare sharing the KV cache with sharing the residual-stream activations, by either replacing the receiver's state or augmenting it. They claim that the KV cache works only if augmented, while the activations work if they replace the receiver's. They explain this with where each of the two enters the receiver's computation, i.e., through the softmax for the keys and through the residual for the activations. To validate their hypothesis, they use a single task, where two copies of Qwen2.5-1.5B read a SQuAD passage, one of them with the answer masked, and test whether the internal state of the copy that read the full passage lets the other one answer.
Critical strengths
Communication between agents through internal states rather than text is an interesting direction, and understanding which internal state should be shared and how the receiver should use it is a relevant question. The paper makes a hypothesis to characterize the effectiveness of two methods (augmentation and replacement) on two different means of transfer (KV cache and residual-stream activations). If the empirical evidence solidly confirmed this hypothesis, that would be a meaningful contribution to the latent communication literature.
Critical weaknesses
First of all, I found the paper very hard to follow, because it introduces a lot of jargon (e.g., "readout map", "tolerable set", "consumption point") and the main table mixes different metrics and sample sizes across columns.
The empirical evidence does not clearly support the main claim of the paper, i.e., "augment the KV cache, replace the activation".
- Holder and receiver are the exact same model, therefore the holder's state is exactly the state the receiver would have computed on the full passage. So overwriting the activations at the answer positions, simply gives back to the receiver the states it would have had if it had read the answer, i.e., it is activation patching, which on the same model is expected to restore the output. Similarly, KV augmentation lets the receiver attend over the cache it would have computed itself on the full passage. Also, the span-copy rate the paper uses to rule out copying only counts answers that are correct and have at least two tokens, so it can never be higher than the accuracy itself, and the gap between the two does not tell whether the receiver is copying.
- The 2x2 is not a fair comparison. Looking at the released code, the KV substitution replaces the keys and the values of every token, including the question, at every layer, with those of the nearest tokens from other passages, while the activation replacement only overwrites the answer positions with the exact activations of the holder. So it is not surprising that the KV substitution does even worse than giving the receiver no help at all. This is far from the "conditions engineered to be maximally favorable to substitution" claimed by the authors: the substituted keys and values come from different tokens, contexts and positions, so nothing guarantees they can work together. Also, the two "augmentation" cells are different operations, so they do not test the same mechanism.
- The paper ranks the carriers as "activations over values over keys", but this comparison is not fair as well. Replacing the activation is the same as replacing both keys and values at all the following layers, so it should be compared with keys and values replaced together, which is only reported at a single layer, where it is not comparable. Replacing the keys alone is expected to fail, since they only decide where to attend, while the content is in the values.
This is important because the main contribution of the paper is not convincingly supported by the proposed experimental setup.
Anyways, the positive results are restricted to a single model and are weak.
- The paper shows that sharing between different model families performs badly on both the KV cache and the activations, and the positive results only refer to a single model, so the motivation of the paper (many agents sharing a pool) is not supported, as the authors admit in the Limitations section.
- Everything is measured on a single artificial task, i.e., recovering a masked answer in a SQuAD passage, with a single seed, and the activation replacement relies on the answer positions, which are taken by comparing the masked and the full passage, and which a real agent would not know.
- The paper is motivated by the idea that agents should communicate in latent space, so that the receiver does not need to rebuild the context by reading text, but the cost of reading the text is never compared with the cost of the proposed methods.
This is important because, even assuming the experimental setup supported the paper's claims, the empirical evidence is not solid enough to show that the proposed hypothesis holds beyond a single model and task.
Questions for authors
My main concerns require new experiments and a substantial rewrite, so I do not expect a rebuttal to be enough to change my recommendation. Still, the following points could affect my assessment.
- Could you compare the two carriers under the same conditions? I.e., a KV substitution restricted to the answer positions, with keys and values replaced together from the same layer on, and both carriers perturbed in the same way and at the same fidelity. If the KV cache still fails while the activations work, this would support the main claim.
- You show that sharing between different model families performs badly on both KV cache and activations, but you only fitted a projection on 40 items, while there is evidence that different models can communicate through learned projections between their representation spaces. As you also say, the bottleneck is the alignment, so this negative result does not tell whether the hypothesis holds across models. Could you test it with a stronger alignment, e.g., a trained projection?
- I am aware this is not something that can be fully addressed in a rebuttal, but to be convinced I would need at least one more task, e.g., one where the information to share is not a short span at known positions. Could you show that the results hold on such a task, even at a small scale?
We thank the reviewers and the area chair for their time and constructive feedback. After careful consideration, we have decided to withdraw the submission and use these comments to substantially improve the work.