- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper studies whether LLM-generated coordination graphs should be adopted in multi-agent reinforcement learning (MARL). The authors propose a three-stage framework: FSGAC evaluates graph proposals before policy optimization using empirical diagnostics; PCEVC audits individual graph edges through paired deletion and doubly robust-style estimation; and ITSC introduces variance-based regularization to improve the stability of semantic coordination types under distribution shifts.
Experiments on MPE, SMACv2, and MDO-Sim report improved graph-admission decisions, edge-level risk estimates, and downstream MARL performance compared with several baselines.
Critical strengths
-
The paper raises a meaningful question: LLM-generated coordination structures are not necessarily beneficial for MARL, and graph proposals should not automatically be incorporated into policy optimization. Distinguishing graph proposal from evidence-based graph adoption is a potentially useful research direction.
-
The experiments consider graph-level admission, edge-level auditing, and robustness under distribution shifts. This is a reasonable evaluation perspective because improved average return alone does not necessarily establish the reliability of an externally proposed coordination structure.
Critical weaknesses
1. The organization and presentation are substantially below the standard expected at ICLR, making the methodological contribution difficult to evaluate.
The manuscript introduces numerous specialized abbreviations, including FSGAC, PCEVC, ITSC, LCB, DR, and several related quantities, without sufficiently explaining their roles and relationships at a conceptual level. The Abstract is particularly difficult to follow because it concentrates heavily on technical terminology and experimental numbers rather than clearly communicating the underlying methodological idea.
The Introduction and Method sections also lack a coherent progression from the identified problem to the proposed solution. Section 3 contains several definitions, lemmas, diagnostic proxies, and optimization objectives, but the motivation for introducing each mathematical component and its relationship to the overall framework are not sufficiently explained.
For example, Lemma 3.2 introduces an algebraic residual decomposition, Definition 3.3 introduces a propagation-sensitivity proxy, and Definition 3.4 combines these quantities into a graph-admission score. However, the manuscript does not convincingly explain why this particular combination should identify graph structures that improve downstream MARL performance.
Similarly, the transition from graph-level admission (FSGAC) to edge-level auditing (PCEVC) and typed regularization (ITSC) is presented primarily as a sequence of mathematical operations rather than a well-justified algorithmic framework.
Although Figure 1 provides a high-level illustration, it does not sufficiently explain the interaction between these components or how the complete framework is trained and executed.
Overall, the presentation makes it difficult to determine which parts represent genuine methodological innovations and which are adaptations of established statistical techniques. This substantially weakens the paper's accessibility, reproducibility, and overall contribution.
2. The theoretical justification and experimental evidence do not sufficiently establish the soundness and necessity of the proposed framework.
The theoretical analysis contains several components whose mathematical validity is narrower than the claims the framework seeks to support.
First, the FSGAC graph-admission score in Eq. (6) combines empirical residual improvement, a complexity-based penalty, and a propagation-sensitivity proxy. However, these quantities are largely heuristic, and the manuscript explicitly acknowledges that the resulting diagnostic is neither an unbiased estimator nor a lower bound on downstream return improvement. Consequently, it remains unclear why the sign of this score should reliably determine whether an LLM-generated graph benefits subsequent policy optimization. The theoretical motivation does not establish this connection.
Second, PCEVC estimates policy-conditioned one-step edge effects under a fixed policy snapshot. Although the authors acknowledge this limitation, the proposed framework uses these estimates to determine which edges should be retained for subsequent learning. A positive one-step effect does not necessarily imply that retaining an edge improves long-horizon coordination or the performance of the subsequently optimized policy. This distinction is particularly important in MARL, where agent interactions and coordination requirements evolve during training.
Third, ITSC regularizes cross-domain variance using typed contributions derived from previously audited edges. However, the audit masks and reliability weights remain fixed while the underlying policy and type representations continue changing. The manuscript does not adequately justify why the original edge-level evidence remains reliable throughout this optimization process.
The empirical results are encouraging but do not fully resolve these issues. In particular, the graph-admission experiment includes 36 conditions derived from only 12 underlying scenarios, limiting the independent evidence for generalization. Moreover, the component ablations mainly demonstrate changes in performance when individual stages are removed, rather than directly validating the theoretical assumptions or establishing the necessity of the proposed diagnostic formulations.
I would also encourage stronger comparisons with simpler alternatives, such as direct validation-based graph selection, standard edge pruning, and conventional variance regularization under comparable computational budgets. Without these comparisons, it is difficult to determine whether the proposed three-stage framework provides benefits beyond combining established techniques.
Overall, the framework contains several potentially useful ideas, but the methodological connections, theoretical justification, and experimental evidence are not sufficiently convincing to establish a sound and distinctive contribution at ICLR level.
Questions for authors
-
What theoretical or empirical evidence explains why the FSGAC diagnostic in Eq. (6), computed using frozen probes and a reference policy, should predict whether a graph improves downstream MARL optimization? Why is the proposed combination of residual improvement, complexity, and propagation sensitivity preferable to simpler validation-based selection?
-
PCEVC estimates one-step effects under a fixed policy. What evidence supports using these estimates to select edges for subsequent long-horizon policy optimization? Do the authors have results demonstrating that the audited edge rankings remain useful after the policy changes?
-
Since ITSC updates the policy and type assignments while retaining fixed audit masks and weights, how is the validity of the original edge-level evidence maintained? Could the authors clarify whether stale audit information negatively affects optimization?
-
Can the authors clarify how the benefits of the proposed diagnostic and regularization mechanisms are distinguished from simpler graph-selection, edge-pruning, or variance-regularization alternatives? This distinction would materially affect my assessment of the algorithmic contribution.