arXiv AI
From Suboptimal to Optimal: One-Step Latent Flow Policies for Offline Reinforcement Learning
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Machine Learning
Jun 2
Mean Flow Policy Optimization
arXiv:2604. 14698v2 Announce Type: replace Abstract: Diffusion models have recently emerged as expressive policy representations for online reinforcement learning (RL).
arXiv AI
4d ago
Discrete Flow Matching for Offline-to-Online Reinforcement Learning
arXiv:2605.12379v2 Announce Type: replace-cross Abstract: Many reinforcement learning (RL) tasks have discrete action spaces, but most generative policy methods based on diffusion and flow matching a...
arXiv Machine Learning
Sep 15
VGFM: Expressive Robot Policies via Dense Value Guidance in Flow Matching
arXiv:2609.14261v1 Announce Type: cross Abstract: Recent robot learning paradigms increasingly rely on large offline datasets of robotic interactions to train control policies. Expressive generative...
arXiv AI
Jun 9
Reinforcement Learning for Flow-Matching Policies with Density Transport
arXiv:2606. 08602v1 Announce Type: cross Abstract: We present an online reinforcement learning (RL) algorithm for fine-tuning flow-matching policies in continuous-control problems.
arXiv AI
4d ago
A Survey of Flow Matching in Reinforcement Learning
arXiv:2610.16275v1 Announce Type: cross Abstract: Flow Matching (FM) has recently emerged as a principled and efficient generative modeling framework for reinforcement learning (RL), enabling express...
arXiv Machine Learning
Jul 9
Latent Policy Steering through One-Step Flow Policies
arXiv:2603. 05296v2 Announce Type: replace-cross Abstract: Offline reinforcement learning (RL) allows robots to learn from offline datasets without risky exploration.