Skip to content
Preprint

CoDrift: Compositional Drifting for Offline Reinforcement Learning

Aug 2026 · 0 citations · 33 references
Computer Science

TL;DR

This work proposes CoDrift, a compositional framework for one-step generative policy learning that combines three objective-level fields into a unified policy field that compares favorably with state-of-the-art methods and achieves the best average rank in both settings.

Abstract

Offline reinforcement learning is intrinsically multi-objective: a policy must remain compatible with the behavioral support of a fixed dataset while preferentially selecting high-value actions. We recast these objectives in a common form by viewing each as an action-space motion field that specifies how generated actions should move. This perspective enables heterogeneous learning objectives to be combined directly through field composition. Inspired by drifting models, we propose CoDrift, a compositional framework for one-step generative policy learning. CoDrift combines three objective-level fields into a unified policy field. The conditional field preserves state-dependent behavioral structure, while the marginal field pools actions across states to provide a more stable generative signal in the single-positive-sample regime of continuous-control offline RL. The value field moves generated actions toward higher-value regions. The composed field is absorbed into a stochastic generator that produces an action with a single forward pass at deployment. We evaluate CoDrift on 73 tasks from OGBench and D4RL in both offline and offline-to-online settings. CoDrift compares favorably with state-of-the-art methods and achieves the best average rank in both settings.

View source

Similar papers

Preprint Aug 2026

Simple Actors and Deep Critics for Scalable Reinforcement Learning

This work revisits where capacity should be invested in an offline actor--critic method and proposes LAC (Light Actor, deep Critic), a lightweight deterministic actor that matches the strongest diffusion- and flow-matching baselines while achieving up to 4x lower inference latency.

Gu-Heon Kang, Jaehwi Lee, Minhae Kwon · 1 citation
Preprint Aug 2026

ReBRAC-v2: The Return of the King

ReBRAC-v2 is introduced, which directly trains an exact-likelihood normalizing flow as the RL actor, combines likelihood, MSE, and MAE behavior regularization, and integrates a classification-based residual critic, staged optimization, and multi-sample test-time action selection, and ranks first in eight categories.

Denis Tarasov, Robert K. Katzschmann · 0 citations
Aug 2026

Latent MeanFlow Policy Optimization for Offline Reinforcement Learning.

LaMPO is proposed, a generative policy framework that formulates offline RL as latent generative policy optimization as well as a behavior-conditioned latent distribution, which provides an informative prior and reduces the modeling burden of the generative process.

Tenglong Liu, Xin Xu, Yixing Lan et al. · 0 citations
Jul 2026

ISO: An RLVR-Native Optimization Stack

Reinforcement learning with verifiable rewards (RLVR) is rapidly advancing the reasoning capabilities of language models, yet the optimization layer that converts reward feedback into weight-space updates remains poorly understood. Building on our prior analysis (Zhu et al., 2025), we study this missing layer through t...

Hanqing Zhu, Wenyan Cong, Zhizhou Sha et al. · 0 citations
Preprint Jul 2026

FlowDAgger: Human-in-the-Loop Adaptation of Generative Robot Policies in Latent Space

The key idea is action inversion: each human expert action is mapped to the noise that would have produced it under the frozen base policy, using reverse-time integration followed by local refinement, which provides supervision for a lightweight latent policy that steers the base model at deployment time, enabling rapi...

Michael Murray, Daphne Chen, Simran Bagaria et al. · 1 citation
Jul 2026

VINE: Taming Generative Control Policies for Reinforcement Learning

VINE is proposed, an RL-oriented sampling method that enables stable end-to-end value-gradient optimization for flow-matching policies and achieves stable policy improvement and consistently outperforms state-of-the-art RL methods on the OGBench offline RL benchmark and real-world robotic manipulation task.

Rushuai Yang, Zhuo Han, Houlin Li et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.