arXiv AI
Flowing Faster to Coordinate: One-Step Online Multi-Agent Flow Policies
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
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...
arXiv AI
Jun 10
Fast and Highly Expressive Policy Learning for Offline Reinforcement Learning via Bootstrapped Flow Q-Learning
arXiv:2606. 10613v1 Announce Type: cross Abstract: Diffusion-based Q-learning has emerged as a powerful paradigm for offline reinforcement learning, but its reliance on multi-step denoising makes both training and inference computationally expensive and brittle.
arXiv AI
Sep 15
Refinement-based Flow Policy Optimization
arXiv:2609.15123v1 Announce Type: cross Abstract: Flow-based policies offer an expressive representation for online reinforcement learning, but conventional flow matching requires samples drawn from...
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
Jun 16
QPILOTS: Efficient Test-Time Q-Steering for Flow Policies
arXiv:2606. 14801v1 Announce Type: cross Abstract: Flow-matching and diffusion policies are expressive action generators, but optimizing them with temporal-difference reinforcement learning (RL) remains difficult.
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...