Flow Q-Learning

Seohong Park, Qiyang Li, Sergey Levine
2/4/2025
cs.LGcs.AI

No official code found. Best implementation: seohongpark/fql (331 stars, MIT, last commit 2025-07-21).

Abstract

We present flow Q-learning (FQL), a simple and performant offline reinforcement learning (RL) method that leverages an expressive flow-matching policy to model arbitrarily complex action distributions in data. Training a flow policy with RL is a tricky problem, due to the iterative nature of the action generation process. We address this challenge by training an expressive one-step policy with RL, rather than directly guiding an iterative flow policy to maximize values. This way, we can completely avoid unstable recursive backpropagation, eliminate costly iterative action generation at test time, yet still mostly maintain expressivity. We experimentally show that FQL leads to strong performance across 73 challenging state- and pixel-based OGBench and D4RL tasks in offline RL and offline-to-online RL. Project page: https://seohong.me/projects/fql/

View on arXivView PDF

Code Implementations(1)

seohongpark/fqlCommunity100%
MIT

The official implementation of flow Q-learning (FQL)

33142PythonFeb 3, 20251 years agoMIT

Similar Papers

Cite this paper

@article{park2025flow,
  title  = {Flow Q-Learning},
  author = {Seohong Park and Qiyang Li and Sergey Levine},
  year   = {2025},
  eprint = {2502.02538},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.02538v2},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.02538.svg)](https://codeofpaper.com/paper/2502.02538)

Discussion