- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper introduces LatentHarness, a training-free approach to selecting which upstream hidden states will be provided to a receiver agent in a latent multi-agent pipeline. Candidates are selected based on sentence boundaries, fixed stride, and response end. Each candidate is evaluated by computing its cosine similarity to a query vector that includes both the question and the receiver's role prompt, as well as the top-k logit-lens token overlap. Then, an MMR-like greedy selection process picks candidates until one of two early stopping criteria is met. For each picked candidate, a span of up to 32 preceding states is created. These spans are then combined, sorted, tagged with role labels, packed into a 256-position budget, and mapped into the input embedding space using the StateBridge closed-form alignment. The experiments were conducted using a four-agent sequential pipeline and a three-expert hierarchical pipeline, with Qwen3.5-4B/9B and Gemma-4-12B on GPQA Diamond, SuperGPQA, BioProBench, and SciCUEval. LatentHarness outperformed both text and StateBridge baselines in most cases while using fewer counted text tokens.
Critical strengths
- The question of which state to provide to each agent is timely and important, and has been given less attention than the issue of how to represent the state. It is logical to treat this as a selection problem on top of an already established alignment method.
- This approach is straightforward and does not require any training. The paper provides sufficient detail for implementation. The GPQA Diamond results were consistent across all three models. The ablations are appropriate controls to evaluate.
- The paper is transparent about the fact that the token savings on SciCUEval are minimal and that the span annotations were not verified by humans.
Critical weaknesses
-
Every chosen state represents a token in a previous response from an upstream source which has been converted into text. An obvious baseline would be to convert the chosen spans back into text and provide those spans as text within the same budget. A random-span baseline using the same budget, span length and sources would also be necessary.
-
StateBridge is the only latent baseline. LatentMAS, KVComm are both training-free and cited, so at least one or two should be compared. A text compression baseline would also be reasonable.
-
The Token metric does not include the delivered hidden states, all upstream generation, the additional forward pass for the query and the LM-head projections for each candidate. In all MAS variants, the Planner, Critic and Refiner still produce complete text responses, therefore total end-to-end cost may not change.
-
Figure 5 appears to have no candidate-position baseline to compare against.
Questions for authors
- The Gemma BioProBench number in Table 3 (63.85) differs from Table 1 (62.98) because of the subset. This is explained in the text but should be in the caption.
- Small grammar issues: “let h_c ∈ R^d denotes” and “reducing textual token by 75.57%”.