- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes MFTS, a diffusion-based data augmentation method for improving trajectory stitching in Decision Transformers. It connects high-return trajectory fragments through bidirectional diffusion and asymmetric fusion, then trains DT on the augmented data. The method shows improvements on several D4RL tasks, particularly in medium-replay settings.
Critical strengths
The paper addresses a meaningful limitation of Decision Transformers. The motivation is clear, and the results on medium-replay datasets are promising.
Critical weaknesses
-
Limited algorithmic novelty. The overall approach is closely related to existing works such as DiffStitch [1] and BiTrajDiff [2], which have already explored diffusion-based trajectory stitching and bidirectional generation. MBRCSL [3] has also studied trajectory stitching without Bellman completeness. The proposed multi-fragment design mainly extends pairwise stitching, while the asymmetric fusion uses a simple, predefined linear weighting scheme. I find the technical novelty rather limited.
-
Lack of global consideration. The method independently generates bridges between adjacent fragments without considering the quality of the complete trajectory. Moreover, fragments are ordered solely by local returns, which does not necessarily guarantee their temporal or dynamical compatibility.
-
Insufficient ablations. The paper does not examine how the number of fragments affects performance. In particular, the trajectory-level stitching gain analysis only considers two fragments, leaving the actual benefit of multi-fragment stitching unclear.
-
Incomplete comparisons. Although BiTrajDiff [2] is discussed in the paper, it is not included in the experiments. The evaluation is also limited to MuJoCo locomotion tasks, making it difficult to assess the generality of the method.
References
[1] Li et al. DiffStitch: Boosting Offline Reinforcement Learning with Diffusion-Based Trajectory Stitching. 2024.
[2] Qing et al. BiTrajDiff: Bidirectional Trajectory Generation with Diffusion Models for Offline Reinforcement Learning. 2026.
[3] Zhou et al. Free from Bellman Completeness: Trajectory Stitching via Model-Based Return-Conditioned Supervised Learning. 2023.
Questions for authors
- How does performance change as the number of fragments increases? Does multi-fragment stitching consistently outperform pairwise stitching?
- Why are fragments ordered solely by local returns? Would considering their compatibility lead to better results?
- Can the authors provide a comparison with BiTrajDiff to better establish the contribution over existing methods?
- How sensitive is the method to the predefined fusion weights? Would other weighting schedules or learned weights achieve similar results?