arXiv Machine Learning
FLAG: Flow Policy MaxEnt-RL by Latent Augmented Guidance
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
Oct 9
Higher-Order Action Supervision Makes A Strong Policy Class
The paper proposes a new loss scheme that simultaneously supervises zeroth- and first-order actions to improve policy performance and control robustness in data-driven decision-making methods such as imitation learning and reinforcement learning. The approach provides formal theoretical guarantees, works with any off-the-shelf policy model, and can be added as a lightweight plug‑and‑play module to existing offline RL frameworks. Experiments on OGBench and D4RL show significant gains in performance, robustness, and out‑of‑distribution generalization, especially in low‑data settings.
arXiv Machine Learning
Jun 25
RN-D: Discretized Categorical Actors for On-Policy Reinforcement Learning
arXiv:2601. 23075v2 Announce Type: replace Abstract: On-policy Reinforcement Learning (RL) remains a dominant paradigm for continuous control, yet standard implementations rely on Gaussian actors and relatively shallow MLP policies, often leading to brittle optimization when gradients are noisy, and policy updates must be conservative.
arXiv Machine Learning
Jun 9
Latent Spherical Flow Policy for Reinforcement Learning with Combinatorial Actions
arXiv:2601. 22211v2 Announce Type: replace Abstract: Reinforcement learning (RL) with combinatorial action spaces remains challenging because feasible action sets are exponentially large and governed by complex feasibility constraints, making direct policy parameterization impractical.
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 8
GenPO++: Generative Policy Optimization with Jacobian-free Likelihood Ratios
arXiv:2606. 06967v1 Announce Type: new Abstract: Generative policies provide expressive and multimodal action distributions, making them attractive for reinforcement learning (RL) in complex continuous-control tasks.
arXiv AI
Sep 3
Action abstractions for amortized sampling
The paper introduces a method that integrates action abstraction into policy optimization for reinforcement learning and generative flow networks. By iteratively identifying frequently used action subsequences in high‑reward trajectories and treating them as single high‑level actions, the approach expands the action space and improves sample efficiency. Experiments on synthetic and real‑world tasks show that this technique discovers diverse high‑reward states more effectively, especially on challenging exploration problems, and yields interpretable abstract actions that reflect the underlying reward structure.