- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents BADA, an approach motivated by a belief error analysis under Lipschitz continuity assumptions. Using a two-head Transformer backbone, BADA takes the agent's own state and action history, and the freshest states of other agents received through communication. It predicts the other agents' action distributions over the delay window, then feeds these predictions back to the state head to predict the other agents' current states. The states are then fed into QMIX to compute Q-values.
Critical strengths
1.The experiments cover both constant and random delays on 2 benchmarks,each with 3 tasks.BADA’s performance in most settings shows its effectiveness compared to 7 other baseline methods.The ablation also shows behaviour prediction is beneficial, reducing belief error and improving return.
Critical weaknesses
1.The analysis in Section 4 is not directly aligned with the method. Theorem 1 bounds the error of a belief propagated recursively, but BADA predicts the current state in a single forward pass.The misalignment weakens the connection between theory and method.
Questions for authors
The relationship between Lipschitz continuity assumptions and BADA is still unclear,the misalignment between Theorem 1 and BADA needs further explanation.
Thank you for your careful review and constructive comments.
W1 and Q1: Recursive analysis, direct prediction, and assumptions
Response: Thank you for requesting a clearer explanation. Our contribution combines the belief-error analysis with behaviour-conditioned, delay-aligned reconstruction. Section 5 connects the analysis to two complementary design choices:
Explicit behaviour prediction. Theorem 1 separates transition and behaviour approximation errors. The bound includes a behaviour approximation term even with exact dynamics, reflecting the unobserved actions of other agents. This motivates a behaviour head that predicts their action distributions over the delay window.
Direct state reconstruction. The analysis shows how recursive predictions accumulate approximation errors across the delay window. This motivates predicting the current state directly, without intermediate state rollouts. BADA's state head receives the predicted behaviour distributions and delay-aligned history representations, then reconstructs the current state in a single forward pass. The reconstruction target is the delay-free state.
The common snapshot is used for the recursive analysis. BADA instead retains each agent's freshest received state through delay-aligned histories encoded by the shared transformer. The two heads have distinct, connected roles: the predicted behaviour distributions condition state reconstruction. Table 1 supports this feedback pathway: retaining behaviour supervision while restoring feedback reduces SMAX belief error from 4.75 to 2.92 and improves win rate from 0.53 to 0.65.
The Lipschitz assumptions define the scope of the recursive error analysis; they do not follow from using a transformer, and ε-greedy policies need not satisfy the policy Lipschitz condition. Theorem 1 motivates this architecture but is not a direct bound on BADA's estimator. In the revised version, we will make the link between the error analysis and the two-head design more explicit and clarify the distinction between the recursive analysis and BADA's direct estimator, including the scope of the Lipschitz assumptions.
Extending error guarantees to BADA's direct estimator and relaxing policy regularity assumptions are useful directions for future work.