arXiv Machine Learning

DeFlow: Decoupling Behavior-Prior Modeling and Value Maximization for Offline Policy Extraction

DeFlow is a decoupled offline reinforcement learning framework that uses flow matching to accurately model complex behavior manifolds. Instead of backpropagating through ODE solvers, it learns a lightweight refinement module within a data‑derived trust region of the flow manifold, preserving iterative expressivity while avoiding solver differentiation. The approach eliminates the need for balancing loss terms and achieves superior performance on the OGBench benchmark, also enabling efficient offline‑to‑online adaptation.

arXiv Machine Learning
Sep 4

Multi-step Proximal Policy Improvement in Offline Reinforcement Learning

The paper introduces Multi-step Proximal Policy Improvement (MPI), a method that refines offline reinforcement learning policies through sequential re-centered proximal steps. By viewing policies as a probability manifold, MPI interprets a wide range of offline actor objectives as a single proximal policy improvement step and extends this to multiple steps for controlled policy improvement beyond the behavior distribution. Experiments on D4RL benchmarks demonstrate that a few MPI refinements enhance strong offline baselines such as TD3+BC, ReBRAC, and IQL, while diagnostics clarify the benefits of re-centered refinement over fixed-objective scheduling and highlight critic error limitations.

By Soohyun Choi, Seonvin Cho, Songnam Hong
Hugging Face Trending Papers
Sep 3

Multi-step Proximal Policy Improvement in Offline Reinforcement Learning

The paper introduces Multi-step Proximal Policy Improvement (MPI), a method that refines offline reinforcement learning policies through sequential re-centered proximal steps. By modeling policies as a probability manifold, MPI interprets a wide range of offline actor objectives as a single proximal policy improvement step and extends this to multiple steps for controlled policy improvement beyond the behavior distribution. Experiments on D4RL benchmarks demonstrate that a few MPI refinements enhance strong offline baselines such as TD3+BC, ReBRAC, and IQL across many tasks, while diagnostics clarify the benefits of re-centered refinement over fixed-objective scheduling and highlight critic error limitations.

arXiv Machine Learning
Oct 12

Reinforcement Learning via Fixed-point Flow Matching

The paper introduces fixed‑point flow matching (FFM), a data‑free method for training and fine‑tuning flow policies in reinforcement learning. FFM formulates the actor update as a fixed‑point iteration using a flow‑matching regression objective, where the critic’s action gradients act as targets. Experiments show that FFM can effectively fine‑tune pretrained flow policies in offline‑to‑online scenarios and train flow policies from scratch in online RL, establishing it as a principled approach for learning expressive flow‑based policies without training data.

By Denis Blessing, Onur Celik, Gerhard Neumann