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).
From Suboptimal to Optimal: One-Step Latent Flow Policies for Offline Reinforcement Learning
Related stories
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.
arXiv AI
Sep 30
Diffusion Policy Improvement with Proposal-Conditioned Refinement Flows
arXiv:2609.36812v1 Announce Type: cross Abstract: Diffusion and flow policies can model complex behaviors in offline reinforcement learning (RL). However, penalizing their KL divergence from the beha...
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 Machine Learning
Jun 30
FlowAWR: Online Adaptive Flow Reinforcement via Advantage-Weighted Rectification
arXiv:2606. 30376v1 Announce Type: new Abstract: Aligning generative flow models on continuous spaces via online reinforcement learning is constrained by intractable trajectory likelihoods.
arXiv Machine Learning
4d ago
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
Jul 23
In-the-Flow Agentic System Optimization for Effective Planning and Tool Use
arXiv:2510. 05592v2 Announce Type: replace Abstract: Outcome-driven reinforcement learning has advanced reasoning in large language models (LLMs), but prevailing tool-augmented approaches train a single, monolithic policy that interleaves thoughts and tool calls under full context; this scales poorly with long horizons and diverse tools and generalizes weakly to new scenarios.
arXiv AI
Sep 15
Learning Multimodal One-step Flow Policy via Value-weighted Optimal Transport
arXiv:2609.15883v1 Announce Type: cross Abstract: Offline reinforcement learning aims to learn a policy solely from fixed datasets, which often contain multimodal action distributions. Flow policies...