arXiv Machine Learning
Flow Matching Policy Optimization with Mirror Descent and Entropy Constraints
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
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 Machine Learning
Oct 15
Generative Actor-Critic with Soft Bridge Policies
arXiv:2605.08733v2 Announce Type: replace Abstract: Expressive generative policies such as diffusion and flow models are appealing for maximum-entropy (MaxEnt) online reinforcement learning because o...
arXiv AI
Oct 1
Diffusion-Augmented Markov Decision Processes for Maximum Entropy Reinforcement Learning
The paper introduces Diffusion-Augmented Markov Decision Processes (DA‑MDPs), a framework that extends Maximum Entropy Reinforcement Learning to diffusion-based policies. DA‑MDPs treat each reverse‑diffusion step as an RL decision, deriving a tractable reverse‑KL bound that decomposes across denoising transitions and yields diffusion‑augmented soft rewards, value functions, and policy objectives. The authors implement this framework with PPO, REPPO, and a maximum‑entropy WPO variant, showing improved continuous‑control performance, higher success rates on manipulation tasks, and memory‑efficient training with action chunking.
arXiv AI
Oct 12
Stochastic MeanFlow Policies: One-Step Generative Control with Entropic Mirror Descent
The paper introduces Stochastic MeanFlow Policies (SMFP), a one‑step generative policy class that merges MeanFlow noise‑to‑action mappings with Gaussian reparameterisation. SMFP captures diverse action modes while providing an analytic entropy lower bound through a learnable conditional Gaussian scale, enabling entropy‑regularised mirror‑descent learning. Experiments on seven MuJoCo benchmarks show SMFP outperforming Gaussian and generative baselines, and additional tests demonstrate effective multimodal action modelling and exploration in sparse‑reward navigation.
arXiv AI
Oct 15
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
Jun 10
Flow-DPPO: Divergence Proximal Policy Optimization for Flow Matching Models
arXiv:2606. 11025v1 Announce Type: new Abstract: Recent work has demonstrated that online reinforcement learning (RL) can substantially improve the quality and alignment of flow matching models for image and video generation.