- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper investigates efficient communication in cooperative multi-agent reinforcement learning (MARL) under partial observability. Existing multi-round communication methods allow agents to iteratively refine their representations using information from teammates, but introduce sequential dependencies and additional communication overhead.
To address this challenge, the authors propose Structured Low-Rank Coupling (SLRC), a one-round communication framework that models inter-agent response dependencies using a structured low-rank affine formulation. Each agent encodes its local intent and interaction factors into a message of dimension $ r^2 + r $. After a single communication round, each receiver aggregates the available messages and solves an $ r $-dimensional linear system to obtain its collaborative representation update.
The paper provides theoretical results establishing exact recovery of the model-defined coupled response under specified conditions, together with its relationship to iterative refinement under a contraction assumption. Experiments across Cooperative Navigation, Predator Prey, SMACv2, and Hallway evaluate coordination performance, communication efficiency, and component contributions. SLRC achieves the highest mean performance among the evaluated methods in 13 Cooperative Navigation, Predator Prey, and SMACv2 scenarios, while exhibiting limitations in sparse-reward Hallway tasks.
Critical strengths
1.The paper proposes a well-motivated structured low-rank coupling mechanism that enables collaborative inference within a single communication round, providing an interesting alternative to conventional multi-round communication methods.
2.The paper establishes exact recovery of the model-defined coupled response under explicit assumptions and provides a theoretical connection to iterative refinement under a contraction condition.
3.SLRC achieves the highest mean performance across all 13 CN, PP, and SMACv2 scenarios among the evaluated methods. The extensive experiments, including ablations, rank analysis, and efficiency comparisons, further support its effectiveness.
Critical weaknesses
1.Although the paper includes several ablation experiments in Section 7.4 and Appendix L, these primarily examine the effects of removing communication and auxiliary loss functions. The contribution of the proposed structured coupled decoder itself is not directly isolated. A controlled comparison with matched model capacity and communication overhead would help verify whether the performance improvements arise from the proposed decoding mechanism rather than other architectural differences.
2.As shown in Table 2, SLRC performs poorly on the Hallway tasks. In particular, its success rate on Hallway 3a is only 1.5%, compared with 100.0% for QMIX_COMM and 96.1% for SMS. The authors attribute this limitation to insufficient learning signals under sparse rewards. Further analysis would be valuable to identify the underlying causes of this degradation.
3.The main experiments remove teammate-related information from local observations to increase the importance of communication. While this is a reasonable setting for evaluating communication mechanisms, the paper does not systematically evaluate SLRC under standard observation settings where teammate information remains available. Additional comparisons would help clarify whether the advantages of SLRC generalize beyond the restricted observation settings.
Questions for authors
Q1: Could the authors provide a controlled ablation comparing the proposed coupled decoder with conventional message aggregation methods, while keeping model capacity and communication overhead comparable?
Q2: Could the authors further investigate the reasons for SLRC's significant performance degradation on the Hallway tasks, particularly Hallway 3a?
Q3: Could the authors provide additional results under standard observation settings, where teammate-related information is retained, to evaluate the generalizability of SLRC's performance improvements?
2 comments
Thank you for the response and additional experiments. These clarifications have addressed most of my concerns, and I have decided to maintain my original score.
Decoder ablations, Hallway failures, and generalization
Thank you for your constructive feedback. Revisions are marked in blue in the updated PDF. We respond point by point below.
Q1/W1. Does the coupled solve itself improve performance?
Table A. Decoder and packet ablations at r=32
We replace only Sc=bˉ with an MLP on (S,bˉ), keeping the sender architecture, packet format, payload, readout, auxiliary losses, and learner fixed. The MLP increases total parameters from 1.5M to 1.6M. SLRC achieves higher mean performance on all three tasks at identical payload, supporting coupled decoding under these controls. To test the matrix packet, bi-only sends bi and sets each zi=Ir at the receiver. Its lower performance across all three tasks shows the cost of omitting the matrix term.
The revised manuscript summarizes these results in lines 496–503 (page 10), with Figure 22 (page 38) and Table 7 (page 39).
Q2/W2. Why does SLRC struggle on Hallway?
Table B. Hallway diagnostics
We perform the same decoder replacement on Hallway 3a and 5a. Success remains below 2% on 3a and at 0% on 5a, while timeout lower bounds rise with substantial variation across seeds. Replacing the coupled solve alone leaves the success gap largely unchanged. Other baselines succeed under the same sparse reward.
The timeout lower bound counts unsuccessful episodes in evaluations whose mean episode length reaches the 19-step limit. Subtracting success and this lower bound from 100% gives the early-arrival upper bound.
Two shared components may contribute. Summed packets may obscure teammate readiness, and sparse feedback gives the sender few opportunities to learn to preserve it. Action values supervising the intent encoder may also provide weak guidance on coordinated waiting. These hypotheses motivate future work on timing-aware packets and auxiliary training signals.
We summarize the findings in Section 7.2, lines 422–426 (page 8), and report Table 3 (page 31), with analysis in Appendix I.2, lines 1650–1661 (page 31).
Q3/W3. Do SLRC's gains persist with teammate observations?
Table C. Win rates with teammate observations, %
We retain teammate features for SLRC, QMIX_COMM, and TGCNet on the Protoss, Terran, and Zerg 5 vs. 5 maps. SLRC achieves the highest mean win rate on all three maps, exceeding QMIX_COMM and TGCNet by an average of 6.58 and 14.92 percentage points, respectively. These results support the generalizability of SLRC's gains to the tested settings with teammate observations.
Appendix G.5 describes the observation setting in lines 1497–1499 (page 28). The revised manuscript summarizes the results in Section 7.2, lines 414–415 (page 8), with Figure 12 (page 31) and analysis in Appendix I.1, lines 1642–1646 (page 31).
Please do not hesitate to ask if you have further questions. If our responses address your concerns, please consider raising your rating or confidence score.