Policy representations in reinforcement learning have expanded beyond Gaussian policies to diffusion and flow-matching based generative policies. However, existing RL methods remain representation-specific, lacking a unified optimization interface for emerging generative policies. In particular, extending likelihood-based objectives to multi-step generative policies couples optimization to their internal generation process, where accumulated likelihood ratios can weaken the update signal. Meanwhile, generative-policy-specific methods often rely on multi-candidate generation and critic-based selection, improving overall return while providing limited improvement to the policy itself. We introduce DR-APO (Decoupled-Representation Advantage-Guided Policy Optimization), which decouples policy improvement from policy representation through advantage-guided target improvement and representation-compatible direct action fitting, providing a shared optimization principle for Gaussian, diffusion, and flow policies. Across five MuJoCo-v5 tasks, DR-APO remains competitive with SAC for Gaussian policies and achieves the best aggregate policy-only performance for both diffusion and flow-matching policies. NavDP post-training improves the Success Rate (SR) from 70.33% to 89.55% in simulation and from 25% to 65% in real-world navigation. These results demonstrate a unified policy-improvement principle across Gaussian, diffusion, and flow policies, from continuous-control learning to embodied-policy post-training.
Figures & tables
Fig. 1: Overview of DR-APO. Advantage-guided target improvement and representation-compatible direct action fitting enable unified optimization of Gaussian, diffusion, and flow policies across continuous control and embodied visual navigation.
Fig. 2: Overview of DR-APO. Policy improvement is decoupled from policy representation through advantage-guided target improvement and representation-compatible direct action fitting across Gaussian, diffusion, and flow policies.
Fig. 3: Learning curves of Gaussian, diffusion, and flow policies on five MuJoCo-v5 tasks. Curves and shaded regions denote the mean and standard deviation.
Policy
Method
HalfCheetah
Hopper
Walker2d
Swimmer
Humanoid
Avg. rank ↓
Final Return
AUC@1M
Final Return
AUC@1M
Final Return
AUC@1M
Final Return
AUC@1M
Final Return
AUC@1M
Final
AUC
Gaussian
PPO
3250.1
3057.5
3022.9
2484.4
3652.1
2547.9
68.4
53.4
541.0
493.2
3.00
2.80
SAC
6538.1
5621.8
3158.3
2420.7
4343.8
3181.8
69.8
58.0
5137.5
3951.5
1.40
1.80
DR-APO
5154.5
4574.1
3288.9
2692.3
4243.2
3202.6
128.7
106.5
2363.9
1945.0
1.60
1.40
Diffusion
AWR
135.5
205.7
144.9
143.9
220.2
228.1
19.2
17.3
640.6
509.2
3.60
3.60
FPO
-587.5
-344.9
40.7
119.4
-2.0
-0.2
2.8
11.1
201.9
197.1
5.00
5.00
TABLE I: Policy-only results on five MuJoCo-v5 tasks. We report Final Return, AUC@1M, and within-family average ranks.
Diffusion Policy
Flow Policy
Env.
QVPO [-1.5pt] P → B64
LSEVPO [-1.5pt] P → B64
DR-APO [-1.5pt] Direct
RFM [-1.5pt] P → B32
DR-APO [-1.5pt] Direct
HC
2981.3 → 8047.0
1924.6 → 8591.7
4572.7
46.0 → 9862.7
4299.2
Hop
324.4 → 2792.6
497.8 → 2506.8
2631.5
806.1 → 1839.8
3016.4
W2
3913.3 → 3130.7
2521.9 → 3316.4
3853.6
48.4 → 3211.1
3650.0
Swi
88.9 → 113.3
83.0 → 112.1
124.9
72.4 → 109.4
124.2
Hum
292.1 → 2191.2
439.4 → 1797.9
1462.0
104.1 → 1470.7
1535.4
TABLE II: Direct policy execution versus Best-of- N critic selection.
Policy
Variant
HC
Hop
W2
Swi
Hum
(a) Target Improvement
Gaussian
Full
5155 ± 317
3289 ± 263
4243 ± 361
128.7 ± 8.7
2364 ± 423
w/o Ref.
1531 ± 263
1071 ± 127
918 ± 93
61.7 ± 7.8
887 ± 157
w/o Weight.
3707 ± 271
2361 ± 216
2238 ± 319
90.1 ± 9.7
1857 ± 383
Diffusion
Full
4573 ± 391
2632 ± 337
3854 ± 431
124.9 ± 9.8
1462 ± 263
w/o Ref.
1784 ± 227
1289 ± 301
1930 ± 349
52.1 ± 7.7
673 ± 91
TABLE III: Ablation studies on target improvement and direct action fitting. Final Return is reported as mean ± SD over five seeds.
Method
Overall
Commercial
Home
SR
SPL
SR
SPL
SR
SPL
iPlanner
45.28
43.54
51.75
50.02
38.80
37.05
ViPlanner
45.08
44.00
55.40
53.94
34.75
34.05
NavDP
70.33
66.85
72.55
69.74
68.10
63.96
NavOL
67.00
63.00
75.20
71.10
58.80
54.90
SIDP
77.43
69.32
82.15
74.16
72.70
64.48
TABLE IV: Closed-loop wheeled-robot navigation performance on InternScenes. SR denotes Success Rate and SPL denotes Success weighted by Path Length.
Fig. 4: Qualitative comparison of pretrained NavDP and DR-APO post-training in simulated and real-world navigation.
Method
NavDP (pretrained)
DR-APO
SR (%)
25
65
TABLE V: Real-world navigation success rate (SR) across 20 scenarios.
Diffusion and flow models provide expressive policy classes for robotic and sequential decision-making systems. However, their action likelihoods are generally intractable, limiting the direct use of widely adopted policy optimization methods such as PPO and GRPO. We propose Doob Policy Optimization (DoobPO), a framework that leverages Doob's h-transform for likelihood-free reinforcement learning fine-tuning of generative policies. DoobPO separates policy improvement from generative policy learning. It first learns a lightweight ratio model that represents the desired policy update, and then distills the resulting ratio-tilted target policy into the generative policy via conditional drift matching. This formulation applies uniformly to both diffusion and flow policies and supports a broad family of policy improvement rules, including PPO and GRPO. We prove that the practical conditional drift matching objective is gradient-equivalent to the ideal Doob drift matching objective. We further show that the induced diffusion process solves an endpoint-constrained stochastic optimal control problem. This establishes that it achieves the minimum-energy modification required to realize the desired policy tilt. Across MuJoCo continuous-control benchmarks, DoobPO achieves strong performance against competitive diffusion- and flow-policy baselines, showing a principled and practical route to RL fine-tuning for generative policies.
Maojiang Su, Qijie Zhu, Yu Xiao +4
Department of Computer Science, Northwestern University · Center for Foundation Models and Generative AI, Northwestern University · Department of Statistics and Data Science, Northwestern University +1
Diffusion policies effectively model multimodal action distributions for robotic manipulation, but their iterative denoising requires tens to hundreds of network function evaluations (NFEs) for each control prediction, limiting their applicability to high-frequency closed-loop control and online reinforcement learning (RL). We present a two-stage framework for native one-step generative policies that transfers iterative refinement from inference to training. First, Drift-Based Policy (DBP) uses a fixed-point drifting objective to internalize corrective dynamics into the model parameters, producing multimodal action chunks with a single network evaluation by design. Second, Drift-Based Policy Optimization (DBPO) augments the pretrained backbone with a stochastic interface that provides exact conditional rollout likelihoods for PPO-style on-policy updates while preserving 1-NFE deployment. On the 12-task Diffusion Policy suite, DBP improves the average success rate from 0.79 to 0.83 while reducing inference from 100 NFEs to 1. Across 37 point-cloud manipulation tasks, DBP achieves an average success rate of 88.4%, surpassing the leading 1-NFE baseline OMP at 82.3%. DBPO further improves pretrained one-step policies through stable online fine-tuning on RoboMimic and D4RL. On a physical dual-arm UR5 platform, DBP achieves 123/150 successes (82%) with an average end-to-end latency of 9.5 ms, compared with MP1's 89/150 successes (59%) under the same setup. Code is available at https://github.com/YuxuanGao0822/DBPO.
Yuxuan Gao, Yedong Shen, Shiqi Zhang +6
University of Science and Technology of China, Hefei 230026, China. · LYNSENSE, Shanghai, China. · iFLYTEK, Hefei 230088, China.
Diffusion models have recently emerged as expressive policy representations for online reinforcement learning (RL). However, their iterative generative processes introduce substantial training and inference overhead. To overcome this limitation, we propose to represent policies using MeanFlow models, a class of few-step flow-based generative models, to improve training and inference efficiency over diffusion-based RL approaches. To promote exploration, we optimize MeanFlow policies under the maximum entropy RL framework via soft policy iteration, and address two key challenges specific to MeanFlow policies: action likelihood evaluation and soft policy improvement. Experiments on MuJoCo, DeepMind Control Suite and HumanoidBench benchmarks demonstrate that our method, Mean Flow Policy Optimization (MFPO), achieves performance comparable to or exceeding current diffusion-based baselines while considerably reducing training and inference time. Our code is available at https://github.com/dongxiaoyi-xyz/MFPO.
Xiaoyi Dong, Xi Sheryl Zhang, Jian Cheng
C2DL, Institute of Automation, Chinese Academy of Sciences · School of Artificial Intelligence, University of Chinese Academy of Sciences · AiRiA +1