- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
JointLoom accelerates learning-based MAPF by replacing producer-side policy inputs with complete compact joint states plus policy context. GPU builders reconstruct backend-specific MAGAT graphs or MAPF-GPT tokens on demand, using explicit cache-dependency and storage-lifetime rules. The same interface supports GPU-resident execution and streaming LaCAM imitation learning. Experiments report semantic checks, timing, mechanism ablations, reduced learner waiting, and matched-budget training progress.
Critical strengths
-
The compact-state reconstruction interface is reusable across execution and expert-supervised training, and is validated with both graph-based MAGAT and token-based MAPF-GPT.
-
The evaluation is unusually rigorous for a systems paper: 11,344 semantic comparisons, input/logit/action checks, Amdahl bounds, and separate reconstruction versus buffering controls.
Critical weaknesses
-
No end-to-end MAPF solution-quality results. The paper reports latency, throughput, and action accuracy, but not success rate, sum of costs, makespan, conflicts, or standard MAPF benchmark outcomes. Thus faster training and execution are not connected to better task performance.
-
Main speedups do not isolate the proposed interface. The 3.79x complete-decision result compares hand-written CUDA with the authors' JAX/XLA–PyTorch implementation, changing kernels, framework composition, synchronization, and builders simultaneously. The stronger cached-prefetch CPU baseline reduces the training gain to about 2x, while the headline 40.8–41.2x update improvement is against a synchronous host-expanded baseline.
-
Generality and external validity are narrow. Only MAGAT and MAPF-GPT builders are implemented; recurrent-state and guided-search interfaces remain future work. Evidence uses one workstation/GPU, mostly fixed Bernoulli maps, three MAGAT seeds, and one online MAPF-GPT seed. The reported
N A^2graph backing and goal caches, rather than compact transport, limit the largest tested scale.
Questions for authors
-
Can you report standard MAPF solution-quality metrics for the trained checkpoints, or explicitly justify why task-level outcomes are out of scope?
-
Can you add a control that separates compact-state delivery from CUDA/framework implementation advantages, such as an optimized GPU-resident JAX/PyTorch builder?
-
Why is the matched-budget headline based on the synchronous CPU baseline rather than cached prefetch? Please include accuracy versus update count and uncertainty for the stronger baseline.
Task outcomes, optimized controls, and input-interface coverage
Thank you for your careful review and for highlighting the connection between training acceleration and MAPF task performance.
W1/Q1. Task outcomes and trained checkpoints
The original fixed-budget study measures throughput and frozen-trajectory expert-action accuracy in a controlled online imitation workload, separate from released MAGAT+ large-scale pretraining and scene adaptation. S4b reports those checkpoints' 256-step task outcomes.
To address task quality, we added complete 52-epoch scene adaptation from released pretrained MAGAT+ 195.pt with live LaCAM correction (S8). Validation-selected JointLoom/CPU models solve 144/150 and 145/150 held-out tasks, from 111/150 at initialization. JointLoom's successful-task mean SoC/makespan is 4,595.42/132.81; S8 also gives paired costs on 139 common successes. The CPU/JointLoom runs take 4h01m55s/2h27m28s (1.64× wall-clock ratio), with actual updates and corrections reported. JointLoom thus supports complete online adaptation with improved MAPF task success.
Under the same official evaluator, window-128 fine-tuning solves 97/128 128-agent warehouse tasks at the fixed-final checkpoint and 118/128 at the validation-selected checkpoint, from 47/128 initially. On 36 common initial/final successes, SoC falls 31,840 to 13,576 and makespan 415.6 to 235.8 (S10). This links windowed compact-record training to improved task success and lower path costs from initialization.
W2/Q2. Implementation, representation and buffering
We appreciate your request to separate delivery and implementation effects. The fully warmed CAMAR-framework discrete MAPF adaptation matches state, checkpoint, precision and goal caches. At 256 env × 256 agents, CAMAR/JointLoom ready-input time is 2.8735/0.3945 ms (7.28×); complete decisions are 156.13/152.86 ms (1.02×). All JIT variants, including post-DLPack, are warmed; timing ends at completed successor state (S2). This confirms a ready-input advantage against a GPU-resident reference.
With the same CUDA builder, learner and records, synchronous/ahead-one-batch prebuilding gives 0.995×/1.021× on-demand throughput; expanded-view storage is about 198× compact storage. Fixed reconstruction with ring depth 1→128 gives 2.96× throughput and wait 67.3% to 6.9% (S7). These controls establish compact-storage savings and throughput gains from buffering.
With common Pogema transitions, queries and learner, three 1,024-update pairs match actions, labels, updates, final model and Adam states exactly. JointLoom achieves 2.09× online / 2.07× full-process speedup (S9). This establishes shorter execution with exact learning-state preservation.
W2/Q3. Cached CPU and learning curves
The main streaming comparison uses tuned cached CPU: 1.98× (1.92-2.12) at eight experts, 2.08× (1.95-2.21) at sixteen, and 2.44× under matched eight-core allocation (S1). Synchronous host expansion is a mechanism control.
Figure S1 shows each seed against updates and wall time. At the shared cap, JointLoom/cached CPU final medians are 78.57%/76.49%. Near 20k updates they are 75.81% (75.25-76.27%) / 76.74% (53.32-76.95%). Curves use H2/Q4 logging; throughput uses H8/Q16. Thus, the time-budget comparison pairs faster training with higher median expert-action accuracy.
W3. Input families, coverage and capacity
Graph, token and CostTracer-architecture CNN inputs cover execution, IL and PPO. Native asynchronous SF and JointLoom complete 0.86435B/1.20416B learner samples in one hour (1.393×); final policies complete 8,730/8,767 goals on unseen mazes (S5). This demonstrates higher one-hour PPO throughput with effective lifelong policies.
MAGAT+ uses 1,000 23x23 warehouse tasks with 32-80 agents; S10 also tests 128 agents on a 32x32 warehouse. PPO trains on three mazes/one warehouse and tests two unseen mazes. S1/S3/S6/S9 use three performance/control seeds; S5/S8/S10 each use one paired training seed.
All hardware timings use RTX 5080 with stated CPU budgets. At 32 env × 128 agents, SF/JointLoom throughput is 257,277+/-909 / 323,857+/-414 samples/s (mean +/- SD over three seeds), using 4.14/1.00 core-equivalents under eight-core affinity (S6). At 256 env × 256 agents, 16-env microbatches reduce peak allocation 8.532 to 2.073 GiB, retaining 1.630 GiB persistent storage. Goal caches, O(N A^2) graph backing and model workspace are accounted for separately. Microbatching improves capacity by reducing model workspace at fixed persistent allocation.
The interface taxonomy specifies recurrent hidden-state update/reset and planner-owned frontier/priorities separately from evaluated builders.
S tables and Figures S1/S2: revised-PDF Appendix A. Records/configurations: JointLoom_Rebuttal_Data.zip and extracted files under rebuttal/data/ at the original anonymous link. Code/data: https://anonymous.4open.science/r/JointooM