CoDrift Improves Offline Reinforcement Learning with Compositional Drifting

Xiewei Ni, Ruofeng Mei, Xiangyu Xu· August 26, 2026 View original

Key takeaways

  • CoDrift is a compositional framework for offline reinforcement learning.
  • It combines behavioral compatibility with high-value action selection.
  • The model uses action-space motion fields for objective composition.
  • CoDrift achieves state-of-the-art results on various offline RL benchmarks.

Who benefits

RoboticsAutonomous VehiclesIndustrial AutomationHealthcareLogistics

Summary

CoDrift is a new compositional framework for one-step generative policy learning in offline reinforcement learning, which combines three objective-level action-space motion fields. It achieves state-of-the-art performance on 73 tasks from OGBench and D4RL by balancing compatibility with behavioral data and selecting high-value actions.

Offline reinforcement learning (RL) inherently involves multiple objectives: policies must align with the fixed dataset's behavioral patterns while simultaneously prioritizing high-value actions. CoDrift, a novel compositional framework, addresses this by recasting these objectives as action-space motion fields. This perspective allows for the direct combination of heterogeneous learning objectives through field composition. Inspired by drifting models, CoDrift integrates three distinct objective-level fields into a unified policy field. These include a conditional field to preserve state-dependent behavioral structure, a marginal field for stable generative signals, and a value field to guide actions towards higher-value regions. The composed field then feeds into a stochastic generator, producing an action in a single forward pass during deployment. CoDrift demonstrated superior performance, achieving the best average rank across 73 tasks from OGBench and D4RL in both offline and offline-to-online settings, comparing favorably with state-of-the-art methods.

Why it matters

CoDrift offers a more effective and robust approach to offline reinforcement learning, which is critical for developing AI agents that can learn from pre-recorded data without needing real-world interaction. This is vital for applications where data collection is expensive or dangerous.

How to implement this in your domain

  1. 1Evaluate CoDrift for offline RL tasks where data collection is limited or costly.
  2. 2Integrate the compositional drifting approach into existing offline RL frameworks.
  3. 3Experiment with CoDrift in simulations for robotics, autonomous systems, or industrial control.
  4. 4Compare CoDrift's performance against current offline RL methods on relevant benchmarks.

Original post by Xiewei Ni, Ruofeng Mei, Xiangyu Xu

"arXiv:2608.23939v1 Announce Type: new 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 commo…"

View on X

Originally posted by Xiewei Ni, Ruofeng Mei, Xiangyu Xu on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses

More in AI Research

AI ResearchAI Engineering & DevToolsAI Investing

FraudBench Benchmarks Adversarial Robustness in Financial Risk Assessment

This paper introduces FraudBench, a protocol-sensitive benchmark for evaluating the adversarial robustness of machine learning models in financial fraud and credit-risk detection. It demonstrates that robustness conclusions are highly dependent on how domain-specific constraints and attacker capabilities are incorporated into the evaluation protocol.

Xitong Zeng, Zhaoge Bi, Yitian Yang, Huaming Chen, Quan Z. ShengAug 26, 2026
AI ResearchAI Engineering & DevTools

Persistent Cross Entropy Extends Topological Data Analysis

This paper introduces Persistent Cross Entropy (PCE), a novel extension of cross-entropy to persistence diagrams, which are used in topological data analysis. PCE bridges different event spaces of diagrams using an induced probability, enabling new applications like distinguishing diagrams with similar persistent entropy and separating causal directions in dynamical systems.

Sijin Yeom, Jae-Hun JungAug 26, 2026
AI ResearchAI Engineering & DevTools

Bridging Numerical PDE Solvers and Neural Emulators for Faster Simulation

This thesis explores the deep connections between traditional numerical solvers for Partial Differential Equations (PDEs) and neural emulators, arguing that they are more alike than different. It proposes that insights can flow profitably in both directions, leading to faster and more efficient scientific and engineering simulations.

Felix KoehlerAug 26, 2026