Pith. sign in

REVIEW 1 cited by

Enhancing Decision Transformer with Diffusion-Based Trajectory Branch Generation

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 2411.11327 v1 pith:3KHNNSQV submitted 2024-11-18 cs.LG

classification cs.LG
keywords trajectorytrajectoriesbranchdatasetgeneratedlearnmodelingsequence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Decision Transformer (DT) can learn effective policy from offline datasets by converting the offline reinforcement learning (RL) into a supervised sequence modeling task, where the trajectory elements are generated auto-regressively conditioned on the return-to-go (RTG).However, the sequence modeling learning approach tends to learn policies that converge on the sub-optimal trajectories within the dataset, for lack of bridging data to move to better trajectories, even if the condition is set to the highest RTG.To address this issue, we introduce Diffusion-Based Trajectory Branch Generation (BG), which expands the trajectories of the dataset with branches generated by a diffusion model.The trajectory branch is generated based on the segment of the trajectory within the dataset, and leads to trajectories with higher returns.We concatenate the generated branch with the trajectory segment as an expansion of the trajectory.After expanding, DT has more opportunities to learn policies to move to better trajectories, preventing it from converging to the sub-optimal trajectories.Empirically, after processing with BG, DT outperforms state-of-the-art sequence modeling methods on D4RL benchmark, demonstrating the effectiveness of adding branches to the dataset without further modifications.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Extremum Flow Matching for Offline Goal Conditioned Reinforcement Learning

    cs.RO 2025-05 conditional novelty 5.0 of 10

    Extremum Flow Matching estimates distributional support bounds from a uniform source and uses them as return conditions for offline goal-conditioned robot policies.

Pith tools