- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies adaptive communication allocation in LLM-based multi-agent reasoning systems. The authors observe that increasing interaction among agents does not necessarily improve reasoning quality: redundant messages increase online token consumption, while poorly targeted communication can propagate flawed reasoning and reinforce incorrect consensus. To address these issues, the paper proposes GAMMA, which decomposes communication decisions into two components: estimating each agent’s contribution to the overall reasoning outcome, and evaluating the cost-adjusted marginal benefit of a communication edge in a given graph. In the offline phase, the authors perform multi-agent rollouts over different communication graphs and construct supervision targets using graph-restricted Myerson contributions and cost-aware conditional edge values. These signals are then distilled into a lightweight GNN. At inference time, the GNN predicts node and edge values from independent agent traces, selects sparse communication edges, and aggregates the updated answers using contribution-based weights.
Critical strengths
-
Clear motivation and a meaningful research problem. The paper addresses two practical challenges, communication redundancy and error propagation.
-
A well-structured game-theoretic supervision design. Modeling graph-restricted Myerson node contributions separately from conditional marginal communication gains helps distinguish the value of an agent from the incremental value of its messages.
-
Broad benchmark coverage and informative core ablations. The paper compares GAMMA with single-model reasoning methods, static multi-agent protocols, and several adaptive topology methods.
Critical weaknesses
-
A potential approximation gap between graph-conditioned edge-value targets and one-shot online edge selection. According to Eq. (9), the true value ΔΦ(e | G) of an edge depends on the current communication graph G. However, the online policy predicts candidate-edge values from independent traces and selects E* in a single pass, without re-estimating conditional gains as edges are added. Appendix H explains the use of conditional-mean estimates learned over the offline graph distribution, but these estimates need not equal the actual marginal gains in the final selected graph. If edges convey redundant or complementary information, positive individual predictions do not guarantee positive joint gains. The authors should quantify this approximation error and provide a targeted comparison with an iterative or graph-aware edge-selection strategy.
-
Insufficient reproducibility details for constructing offline counterfactual supervision targets. A more detailed algorithm and verifiable computational-cost statistics would improve reproducibility.
-
End-to-end costs are not quantified in the efficiency analysis. The main experiments report online inference tokens only.
-
Statistical reliability and generalization across base models are not sufficiently demonstrated.
-
The distinction from recent fine-grained credit-assignment methods could be clearer. For example, Graph-GRPO (Findings of ACL 2026).
Questions for authors
Does the graph-conditional approximation affect joint edge selection? When candidate-edge values are interdependent, how large is the gap between conditional-mean predictions over the offline graph distribution and the true marginal gains in the final selected graph?