- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This work introduces Value-Induced Belief Edges (VIBE), which scores an edge by the expected value of resolving uncertainty about a teammate: given its belief over teammate actions, the receiver values evidence that would change its preferred action and improve its expected return.
Critical strengths
- The paper introduces a sharp and well-motivated decision-theoretic criterion for edge allocation.
- The empirical package is broad and includes useful mechanism-level diagnostics.
Critical weaknesses
- The mathematical presentation and notation are not yet publication-ready, which impedes verification.
- The empirical claims are stronger than the reported uncertainty and effect sizes support.
Questions for authors
- Please add a diagnostic experiment on CCT and small tabular tasks where the ideal value can be computed exactly, reporting top-1 agreement, Spearman correlation, and ranking inversions between practical teacher score and the ideal decision value.
- The “no additional communication” claim relies on teammate features already being present in the receiver’s observation. Please state this assumption explicitly and discuss what happens when those features are absent, delayed, or noisy.
3 comments
Response to Reviewer iuv4
Q1. Diagnostic on CCT and small tabular tasks where the ideal value can be computed exactly: top-1 agreement, Spearman correlation, and ranking inversions between the practical Teacher and the ideal decision value.
We have added this diagnostic on small tabular tasks; it was not run on CCT, and we say so explicitly. On CCT, Table 5 reports agreement with the ground-truth optimal edge (87.63% for VIBE vs 8.73% for Variance-K), not with exact Δ, and App. E.2 now states this distinction.
Tasks. Random tabular games (RTG) use n ∈ {3, 4, 6} agents with m ∈ {2, 3} actions and five families (Indep, CBC, Offset, Corr, HO), with 5 seeds × 400 games per configuration, 60,000 games in total. Beliefs are drawn from Dirichlet distributions covering different entropy, correlation and coupling levels. The two-chance task is a constructed mechanism test with m = 3, at n = 4 and n = 6, with 5 seeds × 2,000 instances per scale. In both, Δ is computed exactly by enumeration, and all criteria use the same instances and information inputs.
RTG results (Eq. 5 vs exact Δ). Top-1 agreement is 49.07%, Spearman ρ* is 0.451 and the inversion rate is 10.31%. Random selection reaches 34.44% and the best of four payoff-variance formulas 80.62% (the advantage-variance formula used by Variance-K reaches 79.63%). By family, top-1 / ρ* / inversion rate are: Indep 51.43 / 0.564 / 7.17%; CBC 50.72 / 0.528 / 9.10%; Offset 46.53 / 0.305 / 15.61%; Corr 51.49 / 0.571 / 6.16%; HO 45.16 / 0.289 / 13.50%. Ties are a major issue: the overall tie rate is 58.33%, mostly because in 49.66% of instances the switch gate fires for no teammate, so Spearman ρ is defined in only 34.66% of instances (29.63–40.71% across families). We report these rates alongside the correlations.
Two-chance task (n = 4 / n = 6). Top-1 agreement is 92.99% / 93.38%, Spearman ρ is 0.805 / 0.764 and the inversion rate is 0.62% / 0.12%, with tie rates of 36.32% / 45.32%. The best payoff-variance criterion reaches 38.37% / 46.12%. When the opportunity priors become unequal (η = 0.75), Eq. 5 falls to 61.59% / 62.96%, below payoff variance × entropy (91.80% / 92.47%).
The practical Teacher thus tracks the ideal ranking closely when decision-pivotal and strongly coupled teammates differ, but not in general random games, mainly because of joint-probe maximisation (see the factorial decomposition in our response to Reviewer iYUX, Q1). All three requested metrics, the task specifications and the factorial results are reported in new App. E.6.
Response to Reviewer iuv4
Q2. State the observation assumption explicitly, and discuss absent, delayed or noisy features.
We agree that this assumption should be explicit. Sec. 2.1 now states it formally: every teammate feature block o_{i→j} processed by the relational channel is part of the receiver's own observation. The "no additional communication" claim holds only under this assumption.
Absent features. We checked the deployed Student against the code used for the submitted runs. It masks the receiver itself and then takes the top-k of the remaining teammates' logits. It does not apply a separate visibility filter, so a teammate that is currently out of sight remains in the ranking and is represented by a zero-filled feature block rather than being removed from the candidate set. The availability mask is privileged and is used only by the Teacher, which renormalises its belief over the teammate's available actions (Sec. 3.2). An empty selection still gives zero relational payload. A consequence, which we now state, is that the Student can assign an edge to a teammate it cannot currently observe, in which case that edge processes a zero block and does not add information. We have corrected App. A.3, which previously could be read as excluding unobserved teammates before ranking. On Predator–Prey the practical effect is limited, because the feature blocks available to a receiver are those of predators inside its local observation grid, but the ranking itself is not restricted to that grid.
Delayed or noisy features. The selected edge processes whatever the receiver observes, so VIBE does not reduce the information available to the backbone. However, noise or delay can degrade both the pairwise belief encoder, which is conditioned on the receiver's recurrent state, and the usefulness of the routed payload. We have not tested this empirically and state it as a limitation.
Unobserved features. Where teammate features are not observed at all, applying VIBE would require an explicit communication channel, and its criterion would then act as a communication-scheduling rule. The appropriate comparison would then be with communication methods that schedule who communicates and when, often by estimating the value of information, and that must handle noisy messages, transmission delays and limited bandwidth (Liu et al., 2026), such as VBC (Zhang et al., 2019) and VIL2C (Zhang et al., 2026).
The assumption is stated in Sec. 2.1, and the limitations paragraph has been added to App. C.3.
We hope the revised manuscript addresses your concerns. If so, we would be grateful if you would consider revisiting your score. We are glad to provide further details.
References.
[1] Liu Z, Li Y, Wang J, Tu J, Hong Y, Li F, et al. Robust and efficient communication in multi-agent reinforcement learning. Chaos. 2026;36(2):022101.
[2] Zhang SQ, Zhang Q, Lin J. Efficient Communication in Multi-Agent Reinforcement Learning via Variance Based Control. NeurIPS 2019.
[3] Zhang et al. VIL2C: Value-of-Information Aware Low-Latency Communication for Multi-Agent Reinforcement Learning. AAAI 2026;40(35):29874-29882.
Response to Reviewer iuv4
We thank the reviewer for the positive assessment and for the concrete requests, all of which we have addressed in the revision.
W1. Mathematical presentation and notation are not publication-ready.
We agree and have revised the formal presentation throughout. In the Introduction we rewrote the ungrammatical sentence summarising the switching decomposition and now refer to Eq. 2 for the formal definition. In Sec. 2.1 we completed the optimisation problem with the explicit constraint |E_i^t| ≤ K. In Sec. 2.2 we made the prior-preserving tie-breaking rule used by Lemma 1 an explicit assumption.
The most substantive correction concerns Theorem 2. Its (1 − 1/e) guarantee for greedy selection relies on submodularity of F_i in the proof, but the original statement did not assume it. Our own appendix shows that F_i is not submodular in general: two independent bits can each have zero individual value but positive joint value. Theorem 2 now states submodularity as an explicit additional assumption for the greedy guarantee, separately from the modular case and the NP-hardness result. This is consistent with greedy guarantees for information-based selection, which likewise rely on submodularity conditions (Liao et al., 2009). The primary K = 1 setting does not depend on this guarantee.
Unresolved internal labels in Appendices A, B and F (e.g. 'teacher-score', 'student-input', 'igm-inclusion') were replaced by proper equation and section references.
W2. Empirical claims are stronger than the reported uncertainty supports.
We agree that several statements went beyond what the spreads support. The ± values in Tables 1–3 are standard deviations across the 10 training seeds, and we now say so in the Table 1 note. Using the per-seed results, we ran Welch's t-tests with Holm correction for a pre-specified family of comparisons (VIBE vs POW-QMIX and VIBE vs Variance-K across tasks) following recommendations for multi-run, multiplicity-aware evaluation of deep RL (Grądzki, 2026).
The tests change the picture in the direction the reviewer anticipated. Against the POW-QMIX backbone, VIBE's improvement remains significant after correction on CCT, corridor and SMACv2 Terran only. Against Variance-K, only the 10m vs 11m gain survives correction (+6.19 pp, p_Holm = 0.038); corridor (0.103), CCT (0.102) and Intersection (0.318) are significant only before correction, and none of the SMACv2 differences is significant. Some differences also go against VIBE: its return is below POW-QMIX on both Predator–Prey settings (39.29 vs 40.04; 38.58 vs 39.79), and its mean is below Variance-K on all three SMACv2 races.
We have revised the text accordingly. The Abstract no longer states that VIBE outperforms the baselines. Sec. 5.2 now reports the Predator–Prey and SMACv2 shortfalls, describes the gains as concentrated in coordination-intensive tasks rather than uniform, and summarises the Holm-corrected result; the full test procedure and results are in new App. G. The Intersection comparison in App. E.5 is qualified (p_Holm = 0.318). The Table 1 note now defines ±.
References.
[1] Liao W, Ji Q, Wallace WA. Approximate Nonmyopic Sensor Selection via Submodularity and Partitioning. IEEE TSMC-A. 2009;39(4):782-794.
[2] Grądzki P. Unstable Gains: Multiplicity-Aware Evaluation of Financial Deep Reinforcement Learning. J. Finance Data Sci. 2026;12:100205.