- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces TH-JEPA, a predictive world model for multi-agent path finding (MAPF). It constructs a dynamic agent–resource conflict hypergraph in which persistent navigation resources represent shared bottlenecks and hyperedge memberships evolve over time. Training consists of masked temporal representation pretraining followed by action-conditioned multi-horizon latent prediction. A conflict-spectral dispersion regularizer (CSDR) is introduced to discourage representation collapse, and the resulting model supports receding-horizon joint-action planning. Experiments on POGEMA and additional MAPF maps report improvements in success rate, congestion, and generalization to larger populations and unseen layouts.
Critical strengths
-
Modeling anticipated contention around persistent resources rather than only current pairwise proximity is a reasonable idea for dense MAPF. The experiments grouping cases by hyperedge cardinality help motivate why higher-order coordination may matter.
-
The paper evaluates population and topology shifts, multi-step prediction, action shuffling, pairwise-versus-hypergraph representation, and learned-versus-oracle dynamics. These results are substantive and suggest that the combined system can improve dense MAPF planning.
Critical weaknesses
-
TH-JEPA primarily combines established components: incidence-based hypergraph message passing, masked JEPA-style predictive pretraining, action-conditioned latent dynamics, dispersion regularization, and receding-horizon planning. The main distinct design appears to be persistent-resource hyperedges derived from short nominal routes. While useful, it is not established that this representation provides a qualitatively new capability beyond resource-aware bipartite graphs, enriched pairwise graphs, or graph world models supplied with the same persistent resource identifiers. The Pairwise-JEPA and Random-HG ablations are helpful, but a capacity-matched resource-aware graph baseline would more directly test this claimed contribution.
-
Theorem 1 formalizes the well-known fact that an unweighted pairwise projection loses hyperedge identity and multiplicity. It does not exclude pairwise models with hyperedge/resource attributes, which are a more relevant alternative. Theorem 2 is a conditional linear-algebra result: if the projected structural energies are bounded below and the off-diagonal terms are sufficiently small, the corresponding Gram matrix is full rank. This does not show that optimizing the finite-weight CSDR loss achieves those conditions, nor does it rule out collapse outside the selected projected subspace. The necessary feasibility condition on the number of projected dimensions relative to the Laplacian rank also deserves discussion. Consequently, the theoretical contribution should be presented more modestly.
Questions for authors
- What does the persistent-resource conflict hypergraph capture that a resource-aware bipartite or attributed pairwise world model cannot capture under an equivalent encoder and planning budget? Do the authors have a matched comparison?
- Does minimizing CSDR ensure the assumptions of Theorem 2 are satisfied in practice? How is the bound affected when the number of projected dimensions exceeds the rank of the conflict-hypergraph Laplacian, for example in highly disconnected states?
- How much of the gain remains when the same candidate generator, collision checks, receding-horizon depth, and readout are applied to a pairwise or alternative learned world model? What is the full per-decision wall-clock cost at 128 agents?
- How sensitive is the method to the hand-defined resource inventory and nominal route lookahead? How does it perform when the resource definitions are incomplete or misaligned with actual contention?
3 comments
Thank you for the detailed rebuttal and additional experiments. I appreciate the authors' efforts to address my concerns, particularly the new resource-aware bipartite baseline, the clarification of the CSDR theoretical guarantee, and the additional planning and computational comparisons.
I consider the theoretical clarification and computational analysis largely satisfactory. The authors now appropriately acknowledge that Theorem 2 provides conditional sufficient properties rather than a general guarantee against representation collapse, and the reported runtime measurements help clarify the practical cost of the proposed planner.
However, I still have some reservations about the methodological novelty. The new resource-aware bipartite baseline achieves performance close to TH-JEPA under a matched world-model and planning framework. This suggests that preserving persistent resource information accounts for much of the improvement, while the distinct contribution of the proposed hypergraph formulation remains relatively limited.
I have two remaining questions:
-
Matched comparison and statistical significance: Table 12 reports 95.3% success for TH-JEPA, whereas the accompanying text and rebuttal report 94.5%. Could the authors clarify the correct result and provide the variability across the five seeds? Given the relatively small improvement over the resource-aware bipartite baseline (94.0%), how statistically reliable is this difference?
-
Representation novelty and resource sensitivity: The authors acknowledge that an incidence-equivalent bipartite encoder can represent the same information as the proposed hypergraph. Could the authors clarify what specific advantage remains attributable to the proposed representation, rather than to persistent resource features and action-conditioned predictive planning? Is there any existing evidence regarding sensitivity to inaccurate resource extraction or different route-lookahead horizons?
Overall, the rebuttal has strengthened my assessment of the paper's technical credibility and experimental rigor. Nevertheless, I remain uncertain whether the methodological contribution is sufficiently distinctive for ICLR. I am therefore maintaining my current rating of 2 (Weak Reject), while recognizing the value of the proposed predictive-planning framework and the authors' substantial efforts to address the review concerns.
Our novelty lies in adapting JEPA to action-conditioned prediction over evolving multi-agent resource interactions. The model learns how joint robot actions change future agent and resource representations, allowing the planner to compare consequences directly in latent space without reconstructing the full environment. Latent-space action planning has not been implemented for this setting.
A bipartite encoder with the same links can represent that bottleneck. What the encoder alone cannot do is predict how contention changes if one group enters and another waits. TH-JEPA rolls both choices forward in latent space before selecting a move. Table 4 shows why this matters: the direct policy using the same hypergraph encoder achieves 85.2% success, while the full predictive planner reaches 95.3%. This supports the value of learning action consequences on persistent resources. A separate gain from the hypergraph form over an incidence-equivalent bipartite encoder remains unmeasured.
For sensitivity, we applied the same extraction rule and eight-step route lookahead to unseen Room and Warehouse maps. This test transfers across layouts.
We appreciate your question and suggestions for the paper. Thank you for asking which gains come from the resource representation and which come from predicting the consequences of actions.
1. Weakness 1 and Question 1 — Contribution beyond a resource-aware graph
A resource-aware bipartite graph can preserve the same agent–resource memberships. Theorem 1 addresses the narrower case of an unweighted agent-only projection. One aisle shared by three agents and three separate pairwise conflicts can produce the same triangle. Explicit resource identities preserve that distinction.
Our contribution is to predict how each persistent resource changes under a candidate action sequence. The original Table 4 reports 85.2% success for a direct policy using the hypergraph encoder and 95.3% for the full predictive planner. This measures the combined benefit of predictive training and planning. Figure 3 further shows that the advantage over Pairwise-JEPA grows from 3.1 percentage points for conflicts involving 3–4 agents to 16.5 points for conflicts involving at least seven.
We added Table 12 in Appendix D.1 for the requested comparison under a shared world-model and planning budget.
2. Weakness 2 and Question 2 — What does CSDR guarantee?
Minimizing CSDR encourages variation and penalizes redundant directions. A finite penalty cannot guarantee that the assumptions of Theorem 2 hold. With N agents and ct connected components, rank(Ct)≤N−ct. Disconnected states therefore support fewer independent directions. We corrected Section 4.5 and Appendix A.1 to state this limit and restrict the theorem to the projected subspace. In the original ablation, removing CSDR lowered success by 3.9 percentage points.
3. Question 3 — Shared-planner controls and wall-clock cost
The original Table 5 keeps the planner fixed and replaces learned transitions with simulator transitions. Success increases from 95.3% to 97.7%. This isolates the effect of transition error. The separate control in revised Appendix D.1 addresses the effect of changing the representation under the same planner.
Original Appendix H reports 31.9 ms per replanning decision on Dense Warehouse at 128 agents. Its timing description includes hypergraph construction, encoding, latent rollout, and scoring. New Appendix I reports a different quantity: total wall-clock time per successful episode. It therefore complements the original latency figure.
4. Question 4 — Sensitivity to resource definitions and look-ahead
Original Appendix B.2 specifies the extraction rules and the eight-step route look-ahead. If extraction misses an aisle, the model loses the resource token that tracks contention there. If a route estimate misses a detour, the model can associate an agent with the wrong resource. Our held-out Room and Warehouse experiments test transfer across layouts using the same extraction rule.