Drift, Then Spread: Learning One-Step Generative Policies for Online Reinforcement Learning
We propose DriftSpread, a one-step generative policy based on Drifting for online maximum-entropy (MaxEnt) RL.
ProofPaper ↗
Key points
- Generative policies offer expressive action distributions for online reinforcement learning (RL), but many diffusion- and flow-based policies require costly iterative sampling.
- To incorporate entropy without a tractable policy density, we build on an energy-based view of Drifting and derive critic-guided Drift and entropy-induced Spread from the negative MaxEnt objective.
- Our method learns these updates sequentially in the same actor, using action regression for value improvement and distribution matching to capture the effect of entropy.
- Under exact fitting with a fixed critic, we prove convergence to the Boltzmann target in the small-step limit followed by the long-time limit.
Sources (1)
- [1]Drift, Then Spread: Learning One-Step Generative Policies for Online Reinforcement LearningarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 11, 02:40 PM
We propose DriftSpread, a one-step generative policy based on Drifting for online maximum-entropy (MaxEnt) RL.
Generative policies offer expressive action distributions for online reinforcement learning (RL), but many diffusion- and flow-based policies require costly iterative sampling.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 11, 2026AesCode: Aesthetic Code Generation with Decoupled Cross-Modal Rewards
- Oct 11, 2026A Sovereign, Indic-First, Reasoning Model
- Oct 10, 2026Single-step Retrosynthesis via Reinforcement Learning from Forward Feedback
- Oct 10, 2026VC-OPD: Visual Counterfactual On-Policy Distillation for Grounded Vision-Language Reasoning
- Oct 10, 2026Co-adaptive Rule Routing and Constraining for Structured Knowledge Retrieval
- Oct 9, 2026Rethinking Relative Policy Differences Transfer of On-Policy Distillation