atlas

Research map / Reinforcement learning / RL from feedback

Aligning Diffusion Behaviors with Q-functions for Efficient Continuous Control

NeurIPS 2024 · Reinforcement learning › RL from feedback · approach: Reward modeling versus direct optimization · 2 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 Efficient Diffusion Alignment (EDA): pretrains diffusion behavior policies as gradients of scalar "bottleneck" networks, then fine-tunes them with a DPO-style contrastive loss over K sampled actions annotated with Q-values.

Problem

Diffusion policies only expose score functions, not tractable densities, so LLM-style alignment (DPO-like) methods cannot directly fine-tune pretrained diffusion behavior policies to optimize Q-values in offline continuous control.

Approach

Represent the diffusion noise predictor as the negative gradient of a scalar network over actions so the scalar output gives the unnormalized behavior density; then fine-tune the pretrained policy by classifying the optimal action among K candidates, with logits given by the density gap between policy and frozen behavior model, generalizing DPO from pairwise preferences to scalar Q-labels.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use EDA (BDM) rather than the strongest listed baselineD4RL overall average · D4RL overallnormalized score: 82.1 -> 83.7Helped
Use EDA (BDM) rather than the strongest listed baselineEDA (BDM) · D4RL Locomotion averagenormalized score: 88.0 -> 87.3Hurt
Use EDA (BDM) rather than the strongest listed baselineEDA (BDM) · D4RL Kitchen averagenormalized score: 69.0 -> 72.0Helped
Fine-tune with only 1% of Q-labelled dataEDA (BDM) · D4RL Locomotionperformance retained: about 95%Hurt
Use value-based alignment instead of preference-based alignment (ablation)EDA · 9 D4RL Locomotion tasksnormalized scoreHelped
Increase the contrastive action count K in preference-based alignment (ablation)Preference-based alignment · D4RL Locomotionnormalized scoreHurt
Fine-tune for about 20K gradient stepsEDA (BDM) · D4RL tasksgradient steps to convergence: 20KHelped

Surprising findings

Limitations

Experimental setup

Datasets: D4RL HalfCheetah D4RL Hopper D4RL Walker2d D4RL AntMaze D4RL Kitchen

Benchmarks: D4RL MuJoCo locomotion D4RL AntMaze D4RL FrankaKitchen

Metrics: normalized D4RL score (mean ± std over 5 seeds) data efficiency fine-tuning convergence steps

Baselines: BCQ CQL IQL DT Decision Diffuser IDQL Diffusion-QL QGPO

Builds on: Direct Preference Optimization Diffusion-QL IDQL Implicit Q-learning VPSDE

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