- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies the structure of successful joint actions in cooperative multi-robot tasks. For a state and instruction, the authors enumerate discretized joint actions in a contact simulator and construct the feasible set F. They define product-set deficiency as delta = 1 - |F| / product_i |proj_i F|: the fraction of the smallest Cartesian-product hull of F that is not feasible. The quantity is the complement of an existing bounding-box fill ratio. Proposition 1 connects non-product feasible sets to the inability of an additive value function to reproduce the entire feasible set as its greedy-action set, while explicitly noting that positive delta does not preclude finding one successful decentralized action.
Validation uses a two-pusher rod task in MuJoCo and three-/four-pusher box experiments. The authors examine action-grid resolution, predicate thresholds, and alternative dependence measures. They then compare IQL, VDN, QMIX, QTRAN, DCG, and two instruction-conditioned DCG variants in a two-agent, multi-step rod environment. The principal findings are negative: delta describes feasible-action coupling but does not predict learning difficulty in the tested settings; coordination graphs show no detectable advantage over independent learning; and the benefits of edge gating are not specific to delta or consistent across seed sets. No hardware experiments are reported, and learning experiments remain limited to two agents.
Critical strengths
S1. An interpretable distinction between feasible-action structure and learning difficulty. The definition gives a clear operational interpretation: independently and uniformly sampling from each agent’s projection of F fails with probability delta. The paper carefully distinguishes representing all successful combinations from finding one successful joint action, and explicitly states that positive delta does not imply an IGM violation (Section 2.1). This distinction is useful because it prevents a structural dependence measure from being mistaken for a general measure of coordination-learning difficulty.
S2. Transparent reporting of negative findings and meaningful controls. The authors examine discretization and predicate sensitivity, compare against total correlation, repeat learning comparisons on fresh seeds, and include always-edgeless and wrong-instruction gating controls. These controls undermine the proposed delta-specific algorithmic explanation, and the paper reports that outcome rather than presenting the favorable replication in isolation (Sections 3.2–3.4; Appendices E, G, K). It also correctly avoids claiming equivalence from a nonsignificant DCG–IQL difference. This transparency strengthens the credibility of the restricted empirical observations.
Critical weaknesses
W1. The incremental contribution of the structural measure is limited, and its distinctive value for learning remains insufficiently established. The authors acknowledge that delta is the complement of an established fill-ratio descriptor, and its ranking is almost identical to total correlation across the 230 tested sets (Spearman rho = 0.978; Appendix E). Proposition 1 establishes a simple property of the entire greedy set of an additive value function, but does not constrain finding a single successful policy, as the paper itself notes. The learning and graph-selection experiments do not establish a benefit specific to the measure. Thus, the remaining contribution is primarily an interpretable application of a known descriptor to feasible-action supports. This may be useful, but the paper does not yet demonstrate sufficient additional insight or utility beyond existing dependence measures to make the contribution compelling for ICLR.
The observed ordering is also narrower than general cross-task validation. The absolute value changes substantially with action discretization (approximately 0.633 at K = 8 to 0.906 at K = 24 for push forward), and the two-agent “each robot just move” control is a product set by construction. Three-/four-agent box tests extend the structural measurement within planar pushing, but do not validate learning consequences outside the two-agent rod environment. A scalar fill ratio also does not identify the relevant coordination graph: the pairwise extension fails to reliably select the intended pair, and the proposed partial-coupling predicate does not impose the intended restriction in 39 of 40 states (Appendix D). These limitations restrict the measure’s demonstrated reach; they do not invalidate its mathematical definition.
W2. The learning experiments do not yet isolate a sufficiently general or decisive negative result. The one-step bandit tests allow independent learners to settle on any matching successful action. Adding a uniform failure penalty does not introduce a safe suboptimal alternative, so the absence of a learning gap does not strongly test the relative-overgeneralization difficulty motivating the work (Appendix I). In the multi-step study, all learning experiments use one two-agent task family and shipped hyperparameters. Replay buffers differ between the DCG family and several factorized baselines (500 versus 5,000 episodes; Table A3), and every method declines after an early peak for an unresolved reason (Appendix J). These factors complicate interpreting the measured gap as a consequence of coordination structure rather than training configuration or task design.
The reported DCG–IQL difference is +1.13 with a 95% interval of [-3.07, 5.32], and the paper acknowledges limited power to detect anything but large effects. This supports “no advantage detected under these settings,” not a general conclusion that explicit coordination is unnecessary. The authors mostly maintain that distinction; the concern is that the resulting negative knowledge is too restricted to compensate for the limited novelty of the descriptor. The hand-specified uncoupled instruction set in LS-DCG, subsequently confirmed by measurement, also does not demonstrate the end-to-end graph-selection procedure of Algorithm 2. A lack of hardware or state-of-the-art performance is not itself a reason for this recommendation.
Questions for authors
Clarification requests
- Beyond interpretability, what specific new inference does delta enable that total correlation or existing support-dependence descriptors do not? Since Proposition 1 concerns matching the entire feasible set rather than finding a successful policy, what makes this connection consequential for the learning problem? A concrete distinction would materially affect the assessment of significance.
- How sensitive are the DCG–IQL and edgeless-DCG comparisons to matching replay-buffer settings and to evaluating the full learning trajectory rather than only the post-peak endpoint? Please distinguish configuration effects from coordination-structure effects using the existing rod task. This matters particularly because all methods exhibit unexplained late decline.
Focused additional evidence that could change the assessment
- Within the existing experimental framework, can the authors test a setting with a genuine competing safe-but-suboptimal action, and examine whether delta predicts the resulting independent-versus-joint learning gap? The uniform failure-penalty experiment does not create this situation. A well-controlled result, positive or negative, would make the learning-related conclusion more informative.
- Can the authors provide a controlled case in which the measured structure, rather than an instruction set chosen by hand, drives a consequential coordination decision? If not, please distinguish the demonstrated descriptive use of delta from the unvalidated practical role of Algorithm 2. The request is for evidence of distinctive utility, not necessarily a new state-of-the-art algorithm.
Future work, not a requirement for the current recommendation
Broader non-pushing environments, continuous-action or stochastic-success formulations, scalable alternatives to K^n enumeration, and hardware deployment would be useful future directions. A new real-robot system or a large new benchmark suite is not requested for rebuttal.