W1. The methodological novelty is relatively limited, as the core idea has already been explored in several existing trajectory stitching approaches.
The central idea of GraphStitch is to combine fragments from different trajectories through shared states to construct new successful demonstrations. However, similar ideas have already been extensively explored in earlier studies on trajectory stitching, offline reinforcement learning, and imitation learning, including BATS, Model-based Trajectory Stitching, DiffStitch, and state-level trajectory stitching approaches.
The authors clearly acknowledge these studies and explain the differences between GraphStitch and existing methods. In particular, GraphStitch constructs complete goal-labeled trajectories from recorded state-action transitions and uses them for LLM-agent supervised fine-tuning, rather than generating connecting transitions or modifying the policy-learning objective.
While these distinctions are valid, they appear to be primarily differences in implementation choices, supervision format, and application setting, rather than fundamental methodological innovations. The core trajectory composition principle remains largely unchanged.
Therefore, the methodological novelty appears relatively narrow, and the paper does not sufficiently demonstrate what new technical challenges are addressed beyond adapting existing trajectory stitching techniques to LLM-agent training.
W2. Lack of direct experimental comparisons with existing trajectory stitching-based methods.
Although the paper extensively evaluates GraphStitch against Won-only and Hindsight baselines, it does not provide direct comparisons with representative trajectory stitching methods.
This omission is particularly important given that the proposed method shares its central motivation and construction mechanism with several existing approaches. The current experiments mainly demonstrate that cross-episode trajectory composition can outperform single-episode hindsight relabeling, but do not establish whether GraphStitch offers advantages over existing trajectory stitching techniques.
For example, prior work on state-level trajectory stitching and combinatorial generalization has already investigated how to construct or exploit behaviors absent from individual demonstrations.
A controlled comparison with representative trajectory stitching methods, adapted to the same LLM-agent environments and training settings, would be necessary to better establish the incremental contribution of GraphStitch.
W3. The performance improvements may be partially influenced by differences in training data volume and supervision distribution.
The main Blocksworld experiment uses substantially different amounts of training data. GraphStitch constructs 7,274 training trajectories, compared with only 557 trajectories for Hindsight.
The authors provide useful controls, including Zero-junction, Strict-stitch, and total-token-matched experiments. However, the total-token-matched GraphStitch dataset still contains approximately 1.95 times as many loss-bearing assistant tokens as the Hindsight dataset.
Furthermore, the constructed trajectories differ in length and goal distribution, which may also contribute to the observed improvements.
Although the existing ablations provide evidence supporting the value of cross-episode composition, they do not fully isolate its contribution from additional supervision or changes in the training distribution. More carefully matched comparisons would strengthen the experimental conclusions.
W4. The effectiveness and generalizability of GraphStitch remain limited in more realistic interactive environments.
GraphStitch achieves substantial improvements on Blocksworld and Countdown, where environment states and transitions can be represented relatively precisely. However, it does not demonstrate statistically significant improvements over Hindsight on ALFWorld.
This limitation is particularly concerning because GraphStitch relies on matching shared intermediate states across different rollouts. In more realistic LLM-agent environments, observations may be incomplete, and identical observations do not necessarily imply equivalent underlying states.
The ALFWorld experiments highlight this challenge: only 14.94% of uniformly sampled candidates are executable after refining the state keys, while almost all candidates constructed using observation-only keys fail replay validation.
These results suggest that the applicability of GraphStitch may depend heavily on accurate state representations and efficient environment replay. Additional evaluation or analysis would help establish when the proposed method provides reliable benefits in practical agent environments.
W5. The claimed experience efficiency does not fully account for trajectory construction and verification costs.
The paper emphasizes that GraphStitch achieves higher performance than Hindsight while using fewer collected rollouts. However, constructing and verifying composed trajectories requires additional environment replay.
For example, in the Blocksworld comparison, GraphStitch with 2,408 collected episodes requires 17,541 total environment invocations, whereas Hindsight with 9,632 collected episodes requires 14,818 invocations.
Although environment replay can be considerably cheaper than collecting new LLM-generated rollouts, the current comparison does not fully characterize the end-to-end computational and interaction costs.
A more comprehensive efficiency evaluation would help clarify the practical benefits of GraphStitch over simply collecting additional rollouts.