arXiv Machine Learning
Generative Actor-Critic with Soft Bridge Policies
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
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 Machine Learning
Aug 28
Simple Actors and Deep Critics for Scalable Reinforcement Learning
The paper introduces LAC (Light Actor, deep Critic), an offline reinforcement learning approach that allocates model capacity to a deep critic rather than a complex actor to improve inference efficiency. It addresses three failure modes—optimization, bootstrap-noise amplification, and value-range drift—using a residual MLP backbone, n‑step bootstrap targets, and a categorical cross‑entropy loss. Experiments on OGBench show LAC matches state‑of‑the‑art diffusion and flow‑matching baselines while reducing inference latency by up to four times.
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 Machine Learning
Sep 18
Improving Online Reinforcement Learning via Bidirectional Behavior Prior Distillation
The paper introduces Bidirectional Behavior Prior Distillation (B2PD), a method that uses action‑value priors to train a conditional variational autoencoder for generating high‑value behavior support. These expert behavior priors are then distilled into the online reinforcement learning agent, reducing inefficient exploration and stabilizing policy updates. Experiments on state‑ and pixel‑based tasks show that B2PD improves sample efficiency while maintaining stable learning dynamics.