ISPACS 2026
Offline reinforcement learning with Implicit Q-Learning on the AD4RL cut-in benchmark
Hyeonsu Kim · Yiwen Shen
Department of Software and Computer Engineering, Ajou University, Suwon, Korea
MOTIVATION
Overtaking slower traffic is efficient — until a neighbor suddenly cuts in.
2
PROBLEM
Learns only from logged driving data — no risky trial and error on real roads.
Bootstrapping with max over a′ of Q(s′, a′) queries actions the data never covered — and their values inflate.
3
CONTRIBUTIONS
01
Rewards speed, punishes collisions hard — pushing the agent toward efficient overtaking.
02
Learns one lane-change policy from Final, Medium, Random and Human-like data together.
03
89.03 normalized score on AD4RL cut-in, measured with the benchmark’s original reward.
4
RELATED WORK
PREDICT THE FUTURE
DECIDE AN ACTION
Rich, complete observations
Copilot4D
ICLR’24 · tokenized world model, discrete diffusion
Trajeglish
ICLR’24 · multi-agent traffic as next-token prediction
RLfOLD
AAAI’24 · RL with online expert demonstrations (CARLA)
Sparse, missing or sudden observations
ITPNet
KDD’24 · prediction from only two observed locations
MS-TIP
ICML’24 · imputation-aware (pedestrian) prediction
This work
Offline IQL lane-change policy for sudden cut-ins
Why IQL?
PNLSVI: pessimistic theory
MOREC: model-based filtering
RIQL: IQL is robust to corrupted data
5
METHOD
1 · VALUE
V(s) ← upper expectile (τ) of Q(s, a) over logged actions
2 · CRITIC
Q(s, a) ← r + γ V(s′)
3 · ACTOR
π ← logged actions weighted by exp(β (Q − V))
No max over a′ anywhere → no out-of-distribution queries.
6
SETUP
BENCHMARK
DATA
INTERFACES
7
REWARD
OURS · USED FOR TRAINING
R = 5 · v if no collision
R = −1000 if collision
Speed is rewarded linearly; the heavy collision penalty keeps aggressive overtaking in check.
AD4RL ORIGINAL · USED FOR EVALUATION
Logged data
rewards relabeled with 5v / −1000
IQL training
lane-change policy
Evaluation in Flow
AD4RL reward, normalized to Random 0 / Final 100
Trained on our reward · scored on AD4RL’s
8
Expert tier (81–100)
62.50
Mean
89.03
R0
R1
R2
R3
R4
R5
R6
R7
R8
R9
RESULTS
89.03
± 9.78 · normalized score over 10 runs
27.70 m/s
mean speed (± 2.21)
1,845 veh/h
mean outflow (± 125)
Round 3 (62.50, gray) dips well below the expert tier, likely a high-speed cut-in where safety and speed incentives conflict; trajectory-level analysis is future work.
9
ANALYSIS
Clips advantage weights, capping the gradient into the policy.
Imitates strong overtakes without chasing only the extremes or copying failures.
Mixes all data qualities in each update, smoothing the critic’s Bellman error.
Fig. 1 · Critic loss (red) spikes in the first epochs while adapting to the new reward scale, then settles; actor loss (blue) levels off near 0.3 with mild oscillation.
10
LIMITATIONS
| Limitation | Next step |
|---|---|
| No baselines or reward ablation | Compare with CQL, BCQ, TD3+BC; train with AD4RL’s original reward to isolate our reward’s effect |
| Safety only via aggregate score | Report collision rate, minimum time-to-collision, near-miss frequency |
| One scenario, 10 runs | All AD4RL scenarios; more runs with confidence intervals |
| Round 3 explained qualitatively | Visualize and analyze the failing rollout’s trajectory |
| Simulation only | Sim-to-real: control latency and sensor noise |
| No comfort term | Jerk limits in the action space or reward |
11
CONCLUSION
01
IQL learns a high-speed overtaking policy from mixed-quality offline data — no online trial and error.
02
89.03 normalized score: expert tier on AD4RL cut-in, scored with the benchmark’s own reward.
03
Weight clipping, β tuning and large batches keep training stable under a large reward scale.
NEXT
Baselines and reward ablation · direct safety metrics · more scenarios · sim-to-real
12
REFERENCES
[1] H. Chu et al., “Decision making for AVs: mixed curriculum RL and safety intervention,” Transp. Res. C, 2025.
[2] I. Kostrikov, A. Nair, S. Levine, “Offline RL with implicit Q-learning,” ICLR, 2022.
[3] D. Lee, C. Eom, M. Kwon, “AD4RL: Autonomous driving benchmarks for offline RL,” ICRA, 2024.
[4] E. Leurent, “An environment for autonomous driving decision-making,” highway-env, GitHub, 2018.
[5] L. Zhang et al., “Copilot4D: Unsupervised world models for AD via discrete diffusion,” ICLR, 2024.
[6] J. Philion, X. B. Peng, S. Fidler, “Trajeglish: Traffic modeling as next-token prediction,” ICLR, 2024.
[7] D. Coelho, M. Oliveira, V. Santos, “RLfOLD: RL from online demonstrations in urban AD,” AAAI, 2024.
[8] R. Li et al., “ITPNet: Towards instantaneous trajectory prediction for AD,” KDD, 2024.
[9] P. S. Chib et al., “MS-TIP: Imputation aware pedestrian trajectory prediction,” ICML, 2024.
[10] R. Yang et al., “Towards robust offline RL under diverse data corruption,” ICLR, 2024.
[11] Q. Di et al., “Pessimistic nonlinear least-squares value iteration for offline RL,” ICLR, 2024.
[12] F.-M. Luo et al., “Reward-consistent dynamics models are strongly generalizable for offline RL,” ICLR, 2024.
13
Speaker notes