atlas

Research map / Reinforcement learning / Offline RL

ACT: Empowering Decision Transformer with Dynamic Programming via Advantage Conditioning

AAAI 2024 · Reinforcement learning › Offline RL · approach: Decision Transformer sequence models · 12 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes Advantage-Conditioned Transformer (ACT), which labels offline trajectories with dynamic-programming-based advantage estimates (IAE or GAE) via in-sample expectile value iteration and conditions an encoder-decoder transformer on the desired advantage instead of return-to-go.

Problem

Decision Transformer conditions on return-to-go, which requires complete future trajectories, cannot stitch trajectory segments, and over-optimistically exploits high returns in stochastic environments.

Approach

Replace RTG conditioning with advantages estimated by in-sample expectile value iteration (IAE = Q - V, or GAE), and use an encoder-decoder transformer with a learned predictor of the maximal in-sample advantage as the test-time target.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace RTG conditioning with advantage conditioningDecision Transformer, yielding ACT · Deterministic Gym MuJoConormalized scoreHelped
Use ACT instead of the strongest listed baselineHalfCheetah-medium · HalfCheetah-mediumnormalized score: 48.4 -> 49.1\pm 0.2Helped
Use ACT instead of the strongest listed baselineHopper-medium-replay · Hopper-medium-replaynormalized score: 97.5 -> 98.4\pm 2.4Helped
Use ACT instead of the strongest listed baselineWalker2d-medium-replay · Walker2d-medium-replaynormalized score: 77.2 -> 56.1\pm10.9Hurt
Use ACT instead of DTACT · Delayed-reward Hopper tasksnormalized score: 65.7_{\pm1.4} -> 49.4_{\pm1.5}; \bm{106.6_{\pm3.7}} -> 95.4_{\pm13.9}Hurt
Use ACT instead of DTACT · Delayed-reward Walker2d tasksnormalized score: 72.1_{\pm4.3} -> \bm{73.8_{\pm1.9}}; 107.4_{\pm0.3} -> \bm{108.1_{\pm0.2}}Helped
Increase predictor expectile σ2 (ablation)ACT · D4RL tasksperformanceHelped
Replace the learned predictor with a constant positive target advantage (ablation)ACT · HC-medium and HP-mediumperformanceMixed
Replace ACT encoder-decoder with GPT-2 architecture (ablation)ACT · Hopper D4RL tasksperformanceHurt
Replace sinusoidal encoding with learnable positional embedding (ablation)ACT · D4RL tasksperformanceNo clear effect
Use encoder-decoder architecture while retaining RTG conditioning (ablation)DT-encdec · D4RL tasksperformanceHurt
Remove predictor cφ and set desired RTG as in DT (ablation)DT variant with ACT architecture · D4RL tasksperformanceHurt

Surprising findings

Limitations

Experimental setup

Datasets: D4RL halfcheetah D4RL hopper D4RL walker2d 2048 game dataset stochastic Gym MuJoCo datasets NeoRL

Benchmarks: D4RL Gym MuJoCo 2048 game stochastic Gym MuJoCo delayed reward D4RL tasks NeoRL

Metrics: normalized score success rate

Baselines: CQL IQL Onestep RL 10% BC RvS DT QDT EDT ESPER

Builds on: Decision Transformer Implicit Q-learning Generalized Advantage Estimation Q-learning with transformer-based conditioning (QDT) Conservative Q-learning

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy