Pith. sign in

REVIEW 2 cited by

DiffStitch: Boosting Offline Reinforcement Learning with Diffusion-based Trajectory Stitching

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.02439 v2 pith:COX6IANJ submitted 2024-02-04 cs.LG cs.AI

classification cs.LGcs.AI
keywords offlinediffstitchtrajectoriesdiffusion-basedlearningmethodsstitchingtrajectory
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In offline reinforcement learning (RL), the performance of the learned policy highly depends on the quality of offline datasets. However, in many cases, the offline dataset contains very limited optimal trajectories, which poses a challenge for offline RL algorithms as agents must acquire the ability to transit to high-reward regions. To address this issue, we introduce Diffusion-based Trajectory Stitching (DiffStitch), a novel diffusion-based data augmentation pipeline that systematically generates stitching transitions between trajectories. DiffStitch effectively connects low-reward trajectories with high-reward trajectories, forming globally optimal trajectories to address the challenges faced by offline RL algorithms. Empirical experiments conducted on D4RL datasets demonstrate the effectiveness of DiffStitch across RL methodologies. Notably, DiffStitch demonstrates substantial enhancements in the performance of one-step methods (IQL), imitation learning methods (TD3+BC), and trajectory optimization methods (DT).

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Compositional Diffusion with Guided Search for Long-Horizon Planning

    cs.RO 2025-12 conditional novelty 6.0 of 10

    CDGS adds population-based search and likelihood-based pruning to compositional diffusion, enabling long-horizon planning from short-horizon models across robot manipulation, panoramas, and video.

  2. Decision Flow Policy Optimization

    cs.LG 2025-05 reject novelty 6.0 of 10

    Decision Flow frames the gradual action generation of flow-based policies as a flow MDP and updates the flow policy with flow-level value functions, reporting state-of-the-art results on several D4RL tasks.

Pith tools