- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces CLIC (Closed-Loop Information Control), a training-free external controller for multi-agent LLM systems that regulates inter-agent communication through per-neighbor context-token budgets (). At each coordination epoch, agent proposals are mapped via a frozen encoder (BGE-M3), random projection, and quantization into compact semantic sketches. A transmission trigger based on Gaussian Bayesian surprise and an age penalty decides whether to broadcast a sketch. Receivers apply clipped geometric-median fusion to bound outlier influence, compute bidirectional usefulness scores to form a symmetric doubly stochastic mixing matrix , and analytically select a spectral coupling coefficient to balance coherence, diversity, and recovery speed. This coupling is then converted into token budgets to truncate neighbor messages for the next inference round. Experiments across five benchmarks (MMLU-Pro, HumanEval, MultiAgentBench, Collab-Overcooked, and PEAR) show improvements in clean accuracy and Byzantine robustness alongside a 39.9% token reduction relative to Full Mesh.
Critical strengths
1. Extensive Empirical Evaluation and Diagnostic Rigor
The paper evaluates five distinct benchmark families covering reasoning, coding, embodied cooperation, and adversarial attacks (independent/colluding Byzantine agents and prompt injection), backed by a clean ZebraLogic pilot study (Section 2, Appendix B) that isolates receiver-conditional routing under relevance shifts.
2. Lightweight Training-Free Execution
Operating entirely on low-dimensional projected semantic sketches () without modifying backbone weights, the controller incurs negligible computational overhead (8.7 ms per epoch, Appendix Table 3 & 12), resulting in practical wall-clock latency reductions compared to unrestricted communication.
Critical weaknesses
1. Post-Generation Context Filtering vs. Pre-Generation Adaptive Gating (Limited Efficiency Ceiling)
CLIC regulates which already-generated messages enter a neighbor's context rather than whether an agent needs to generate a response in the first place. In Algorithm 1 (Lines 1–4, 28), all agents generate proposals across a fixed 4-round horizon in the primary static-task setting. The transmission trigger only filters messages after generation, without avoiding the corresponding LLM invocations. Consequently, CLIC still consumes approximately 2× the tokens of a Single Agent (16.4K vs. 8.2K in Table 2).
In contrast, recent approaches explore adaptive stopping (Hu et al. [2]) or confidence-guided, pre-generation agent engagement (Yoa et al. [3]) to avoid unnecessary inference. While CLIC substantially reduces token costs relative to Full Mesh, its fixed agent-invocation schedule limits the achievable efficiency gains.
2. Disconnect Between Theoretical Controller State () and Context-Level Actuation
The paper emphasizes epochwise convergence and Byzantine bounds over semantic mixing steps on (Eqs. 6–11). However, in Algorithm 1 (Lines 22–28), the terminal state is not explicitly used to condition the next LLM inference or allocate tokens; context budgets (Eq. 9) depend solely on and . Thus, the functional contribution of the -step iteration to actual LLM inference remains unclear, despite its central role in the theoretical analysis.
Furthermore, translating continuous weights into deterministic tokenizer-boundary truncation (Appendix E, line 1078) may remove final conclusions or critical code blocks when allocations are small (e.g., 84 tokens in Appendix I, Example 2). This raises concerns about whether the theoretically controlled semantic influence is faithfully reflected in the actual context delivered to each agent.
References
[1] Choi et al., Debate or Vote: Which Yields Better Decisions in Multi-Agent Large Language Models?, NeurIPS 2025.
[2] Hu et al., Multi-Agent Debate for LLM Judges with Adaptive Stability Detection, NeurIPS 2025.
[3] Yoa et al., Efficient Multi-Agent Reasoning via Confidence-Guided Adaptive Debate, ICML 2026.
Questions for authors
Q1. Symmetric Edge Rule vs. Directed Error Correction
In Section 4, CLIC enforces symmetric edge weights through . When a Verifier identifies a critical error in a Proposer's output, could low reverse usefulness suppress this one-directional corrective feedback? Given the importance of targeted corrective updates in multi-agent debate (Choi et al. [1]), could the authors provide an ablation comparing the current symmetric rule against directed or role-aware routing?
Q2. Token Accounting for Majority Vote
Could the authors clarify the token accounting in Table 2, where 1-round Majority Vote requires 18.6K tokens while 4-round CLIC requires 16.4K? A breakdown of prompt, completion, and final-synthesis tokens would help explain this difference.
2 comments
Q1. Could low reverse usefulness suppress a one-directional correction, and can the authors compare symmetric routing against directed routing?
Receiver-specific usefulness is computed before the symmetric graph is constructed, so symmetry does not imply that the controller ignores the receiver’s information needs. Appendix B, Table 4 demonstrates adaptation when a receiver’s question changes while candidate messages remain fixed. The minimum rule nevertheless requires mutual usefulness, which can restrict a correction whose value is strongly one-way. The symmetric construction in Equation (5) provides the matrix properties used by the spectral derivation, so a directed comparison must isolate routing without applying those formulas outside their assumptions. Table I2 does this by holding the coupling fixed across both variants and matching candidate messages, receiver scores, and budget envelopes. The directed variant allocates each receiver’s neighbor budget according to incoming usefulness scores.
Table I2. One-way correction diagnostic extending the ZebraLogic pilot. Both variants use the same fixed coupling.
| Routing rule | Critical-correction retention (%) | Receiver correction accuracy (%) |
|---|---|---|
| Symmetric mutual-usefulness allocation | 85.0 | 79.0 |
| Directed receiver-score allocation | 91.0 | 82.0 |
The symmetric rule retains 85.0% of critical corrections, showing that useful directional feedback can pass through the mutual-usefulness construction. Directed allocation improves retention to 91.0% and receiver accuracy from 79.0% to 82.0% in this deliberately one-way setting. This identifies where directionality helps, while the paper’s existing results establish the effectiveness of the complete symmetric controller across the broader benchmark suite.
Q2. Why does one-round Majority Vote require 18.6K tokens while four-round CLIC requires 16.4K, and can the authors provide a breakdown?
The reported values are total tokens per instance for two different methods, rather than costs of successive voting rounds. Appendix E defines Majority Vote as five independent agents with synthesis used only for tie resolution, while static CLIC uses four coordination epochs followed by final synthesis. All prompt and completion tokens are counted, so round count alone does not determine total expenditure. Our inspection of the logs identified exchanges in which resolving disagreement required additional processing, followed by shorter exchanges once context had accumulated.
We thank the reviewer for their thoughtful review. Due to space constraints, we have divided our rebuttal across multiple comments, organized by Weakness (W) and Question (Q) numbers. Where a weakness or question raises several concerns, we address them separately so that each point receives a clear response.
W1. "CLIC regulates which already-generated messages enter a neighbor's context rather than whether an agent needs to generate a response in the first place."
Generating a proposal does not eliminate the cost of processing it in other agents’ contexts. CLIC controls this repeated processing through the transmission trigger in Equation (3) and context allocation in Equation (9). Appendix E counts all prompt and completion tokens, including proposal generation, repeated task text, memory, and final synthesis. The savings therefore include the generation cost raised by the reviewer. Under the matched schedule in Section 5, Table 2 shows tokens decreasing from 27.3K with Full Mesh to 16.4K with CLIC and latency from 36.8 s to 25.1 s, while all five quality metrics improve. Table 9 reports 50.2% token reduction in the homogeneous ten-agent setting. Communication control therefore provides substantial savings even with agent invocation held fixed.
"CLIC still consumes approximately 2× the tokens of a Single Agent."
This comparison should be read together with task performance. Table 2 shows that CLIC improves MMLU-Pro accuracy from 54.8% to 67.3% and HumanEval Pass@1 from 49.1% to 64.4% relative to Single Agent, with larger gains on collaboration metrics. CLIC provides stronger collective performance while reducing the cost of unrestricted collaboration. Adaptive stopping and engagement before generation address whether another invocation is needed, while CLIC addresses which information each invocation receives. These decisions are complementary. Holding the invocation schedule fixed isolates communication control and prevents gains from being explained by unequal opportunities to reason. The paper establishes this contribution without claiming to exhaust every source of savings.
W2. "The functional contribution of the K-step iteration to actual LLM inference remains unclear."
The analysis derives the coupling that determines the next model context. For the disturbance-free dynamics in Equation (6), retained private variation in a disagreement eigenmode is
hk(α)=1−αλk1−α.
Equation (7) derives the coherence and diversity constraints from this expression, and Equation (8) selects the smallest coupling satisfying these and the recovery requirement. Equation (9) applies that coupling through
Lije=⌊Lcαe,⋆Wije⌋.
The theory therefore affects inference through an explicit allocation rule, implemented in Algorithm 1, steps 15–28. The terminal semantic vector is not inserted into the prompt, and more mixing steps with the graph and coupling fixed do not alter allocation. The practical contribution is the spectral selection rule. Table 1B tests it directly, with adaptive coupling improving clean and robust scores from 74.8 and 61.9 to 76.3 and 63.7 over the tuned constant. The additional paired analysis gives Holm-adjusted p-values of 0.028 and 0.024, while Table 11 reports only 0.8 ms additional controller time per epoch. This provides task-level evidence beyond convergence alone.
"Deterministic tokenizer-boundary truncation may remove final conclusions or critical code blocks when allocations are small."
The 84-token example in Appendix I concerns an adversarial message, while the verifier message receives 436 tokens. It illustrates selective restriction of malicious content. Equation (9) assigns budgets according to the graph and coupling, and Appendix E specifies their implementation. Table I1 tests whether preserving complete structured fields or code units improves delivered context under the same allocation caps, without additional model calls or changes to controller settings.
Table I1. HumanEval context-construction diagnostic under matched allocation caps.
Structure-preserving packing improves critical-correction retention by 6.0 percentage points and Pass@1 by 0.6 percentage points.
The submitted implementation retains 86.0% of critical corrections, while preserving complete units improves retention without changing the spectral allocation mechanism. This supports a practical refinement of context construction. The Pass@1 difference remains descriptive without a paired significance analysis, and matched caps do not establish identical realized token use. The guarantees in Section 4 and Appendix J concern semantic dynamics, while this diagnostic directly evaluates whether important textual corrections survive.