- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes LLM-SemanticLAN, a framework for cross-model KV cache communication through a shared latent space. Using anchored initialization and model-specific codecs, new models can communicate with existing members after training against only one partner. Experiments evaluate communication quality and efficiency across heterogeneous models and modalities.
Critical strengths
The proposed multi-model communication framework addresses a practically meaningful problem. Single-partner admission and interface reuse could reduce the cost of integrating new models into heterogeneous systems.
Critical weaknesses
W1. Insufficient comparisons with relevant baselines.
Cross-model KV cache transfer and shared latent communication have already been explored in prior work. However, the paper primarily compares against T2T, with only a limited pairwise ridge-regression baseline. Without comparisons to competitive KV transfer and shared-space methods, it is difficult to assess the actual technical contribution.
W2. The practical benefits of the proposed framework remain unclear.
The main claimed advantage is that new models can join a shared space without training pairwise translators. However, the paper does not adequately quantify the offline training and admission costs or compare online efficiency and communication quality against existing approaches. Thus, the practical benefits of the proposed design remain insufficiently demonstrated.
W3. Inconsistency between the described method and released implementation.
Equation (3) describes only receiver-behavior-based losses, whereas the supplementary code introduces additional latent consistency and mean-matching losses (admission/medical/engine.py and admission/hybrid/engine.py). These undisclosed objectives may affect the reported performance and make it difficult to attribute the gains specifically to anchored initialization.
Questions for authors
Q1. What are the main technical advantages over existing KV transfer and shared latent-space methods? Can the authors provide fair comparisons with competitive baselines?
Q2. How do offline training/admission costs and online latency, computational overhead, and communication quality compare with existing methods as the number of models increases?
Q3. Were the additional latent alignment losses in the released code used for the reported experiments? If so, why are they absent from Equation (3), and how does performance change without them?
6 comments
Response to Reviewer 389s (2/4): comparison with prior methods (W1, Q1)
W1 / Q1. Comparison with prior methods. Against pairwise methods, LLM-SemanticLAN serves directions never trained. Against the jointly trained space of Dery et al., LLM-SemanticLAN differs in how the space is trained. Our latent space starts from a closed form onto a frozen reference and trains on the behaviour of the receiver. Dery et al. use no reference model and train their adapters jointly on continuation. The ablation of the paper removes each of our two choices in turn, on Web over the six directions among the initial models (Figure 5, Table 5 in Appendix C). Without the closed-form start onto the reference, with randomly initialized codecs and everything else unchanged, the codecs answer 0.8% of the questions that the closed-form start answers at 85.3%. This control is why the latent space is anchored on a reference. With continuation alone, accuracy falls to 74.5%, and the gap of ten points does not close with more training. The ablation runs under our data, codecs and budget, so it carries no difference in data or model size, and it does not reproduce the system of Dery et al.
Adding a model is also cheaper. In LLM-SemanticLAN, a new model trains only its own codec, 0.8–3.6% of the size of the new model, against one frozen member. In Dery et al., a new model trains its own adapters, about a quarter of the size of the new model, against two partners. The latent of LLM-SemanticLAN is also 64× smaller than a native cache on average (Table 7 in Appendix D).
Our setting follows how a multi-agent system divides work. One model reads a document, a tool output or an image and hands what it read to a model that has not read it, and any model may hand off to any other. Our setting is also the economical one. The sender prefills the input once, and each receiver prefills only its question, so a passage sent to multiple receivers is prefilled only once. C2C addresses a different task, in which both models read the same input and the sender's cache is fused into the receiver's own cache of that input to improve the receiver's answer. C2C therefore cannot run when the receiver has not read the input, and a passage sent to multiple receivers is prefilled multiple times. The other pairwise methods (Heo et al., Qu et al., XKV) train one module per ordered pair, so no pair works before that pair is trained. T2T is the main reference because written messages are the common way models communicate and collaborate today and work between any two models. Two existing designs also run in our setting, and the paper compares against both.
- Pairwise closed-form map (Heo et al., 2026). On Web, Qwen3-14B→4B reaches 79.2 against 87.5 for LLM-SemanticLAN, which is 8.3 points ahead, and Qwen3-4B→14B reaches 82.8 against 84.2, a gap of 1.4 points that is not statistically significant. The gap is on exact values, answers such as amounts, account numbers or full dates copied character for character from the passage (Table 5 in Appendix C), with 48.9 vs 77.1 and 45.8 vs 69.5. Between Qwen3-8B and Qwen3-4B, two models with the same number of layers, the map is ahead by 2.8 points, 90.0 against 87.2. The map stores 2.7B parameters for that one direction, against 143M for a codec. Our next comment compares a map of the size of a codec. The map is undefined across tokenizers and architectures, and every direction needs its own fitted map, so no direction works without fitting. In the revised PDF, Appendix D.2 reports all three directions.
- Jointly trained shared space (Dery et al., 2026). Beyond the ablation above, Dery et al. add a new model against two partners. In our setting, a second partner helps only the directions between the new model and that partner. Adding Llama-3.1-8B against Qwen3-8B alone, or against both Qwen3-8B and Qwen3-4B, gives results within 1.4 points on the never-trained directions between Llama-3.1-8B and Qwen3-14B. In the revised PDF, §4.5 states how these ablations relate to the system of Dery et al.
Response to Reviewer 389s (3/4): a pairwise map of the size of a codec (W1, Q1)
W1 / Q1, continued. A pairwise map of the size of a codec. We add the pairwise closed-form map (Heo et al., 2026) at the size of one codec. The recipe is unchanged, and we only limit how many sender layers each receiver layer reads. We set this number to 2 because it is the setting whose parameter count equals that of a codec, 151M per direction (168M into Qwen3-14B) against 143M to 151M. The 2 layers are chosen for each receiver layer by the single-layer ranking of the recipe itself. The map has a closed-form solution, so it involves no training steps. Each map is fit for its own direction on 450 FineWeb-Edu passages that do not overlap the evaluation set. We re-ran the main-table checkpoint on the same 1,345 answerable Web questions and scored both systems in one judge run, so every question is answered by both systems and the comparison is made question by question. The re-run values differ from those of the paper by −0.5 to +1.6 points. All three directions are directions our codecs were trained on.
| Direction | Ours | Map of codec size |
|---|---|---|
| Qwen3-4B→Qwen3-8B | 86.8 | 90.9 |
| Qwen3-8B→Qwen3-4B | 86.7 | 75.5 |
| Qwen3-8B→Qwen3-14B | 88.0 | 38.3 |
The table gives judge accuracy in percent, the share of questions answered correctly, and not the percent of T2T used in Table 1. Bold marks the higher score. All three gaps are statistically significant (paired bootstrap, 95% level, intervals in Appendix L). On the questions whose answer is a long number copied character for character from the passage, such as an amount or an account number, the scores are 85.5 for ours against 90.8 for the map, 79.4 against 55.7, and 77.1 against 2.3.
Between Qwen3-4B and Qwen3-8B the map of codec size is 4.1 points ahead of us in one direction and 11.2 points behind in the other. Into Qwen3-14B it no longer works, with 38.3 overall and 2.3 on long numbers, while the codec is unaffected.
The architectures explain the difference. Qwen3-4B and Qwen3-8B have the same depth and head layout (36 layers, 32 attention heads, 8 key-value heads of 128 dimensions) and differ in width (2,560 against 4,096). For each of their 36 layers, the layer of the other model that predicts its cache best is the layer with the same index, so a map that reads 2 layers still finds most of what it needs. Qwen3-14B has 40 layers, 40 attention heads and width 5,120. Its 40 layers do not line up one to one with the 36 of Qwen3-8B. Only 10 of the 40 are best predicted by a sender layer at the same or an adjacent index, and the best single sender layer explains 56% of the cache variance on average, against 66 to 68% between the two 36-layer models. The content of one receiver layer is spread over several sender layers, which a map of codec size cannot collect. A codec does not rely on any correspondence between layers, because every model writes into and reads from the same latent. The reference is what puts the three models in the same coordinates. Right after the closed-form start, before any training, the cosine between the latents of two models is 0.86 for the two 36-layer models and 0.84 for each pair that includes Qwen3-14B.
A map serves one ordered pair and is fit on paired caches of that pair. A codec is trained once per model, serves every direction including directions never trained, and crosses tokenizers and architectures. In the revised PDF, Table 2a in §4.2 and the new Appendix L report these numbers.
Response to Reviewer 389s (1/4): consistency term (W3, Q3)
Thank you for reading the released code closely and pointing out that Eq. 3 omits the consistency term. We answer W3 first.
W3 / Q3. Consistency term. Yes, training uses this term, and the term was left out of Eq. 3 in error. We apologize for the omission. Eq. 3 followed an earlier form of the objective, which did not have the term. The term was added later, and because it does not change accuracy we treated it as a training detail and did not carry it into the equation. That was the wrong call. The omission is in the written equation only. The term asks two members to write the same latent for the same passage. During the joint training of the initial models, whenever two members encode the same passage, the term adds two losses, each with weight 4.35. The first is one minus the cosine between the latents of the two members at each position, after the mean latent of each member over the batch is subtracted. The second is the squared distance between the two mean latents. The term is not limited to the initial models. When a text model is added, the same term, with the same weight, pulls the latents of the new model toward the latents that the frozen partner writes for the same passage. The term thus carries out the alignment with one member that §3.5 describes. One rule decides where the term is used. It compares the latents that two members write for the same input, so it is used wherever a second member can encode that input, with the same weight. This covers the initial models and every added text model, and every text result in Table 1 was trained with it. The visual encoder of §4.3 is the only exception. No text member can encode an image, so there is no second latent of the same input, and the visual encoder was trained without the term (both weights are 0 in the launch scripts of the g3 runs). In the revised PDF, the term is Eq. 3b in §3.4, and Appendix D gives its weight.
The reported accuracy does not depend on the consistency term. The table below gives the ablation with Qwen3-4B↔Qwen3-14B held out from training. With our limited computational resources, each configuration trains for 2,000 steps instead of the 16,000 steps of the main checkpoint, and an LLM judge scores the answers. The last column gives the change in points when the term is removed, and marks the changes that are statistically significant. A change is significant when the 95% confidence interval of the paired difference, from a bootstrap over questions, excludes 0 (intervals in Appendix K). Exact values are the questions whose answer is a value of at least six digits copied character for character from the passage, such as an amount, an account or tracking number, or a full date (Table 5 in Appendix C, question types in Appendix G).
Without the term, exact values on untrained Synthetic directions drop by 3.9 points, so the term mainly protects exact values. With the weight halved to 2.2, every average accuracy over trained and untrained directions changes by at most 1.6 points. The random-weight start in Figure 5 keeps the term at full weight and still answers only 0.8% of Web questions, against 85.3% from the closed-form start. Without the term, the cosine between the latents of two members falls from 0.95 to 0.68, yet untrained directions keep their Web and overall Synthetic accuracy. Communication on untrained directions therefore does not depend on the term.
We also removed the term when a model is added. We added II-Medical-8B to the main-table latent space twice, against Qwen3-8B alone, from the same closed-form start and with the same data order, for 2,000 steps. One run keeps the term at weight 4.35 and the other sets it to 0. The table gives judge accuracy in percent for the four directions between II-Medical-8B and the two members it never trained with, on Web (1,345 answerable questions per direction).
On Synthetic the same four directions give 95.4 and 95.3. None of these changes is statistically significant (same test, intervals in Appendix K), so removing the term at admission makes no measurable difference. One limit applies. II-Medical-8B is a fine-tune of Qwen3-8B, so this is the easiest case for alignment. In the revised PDF, the new Appendix K reports both ablations.