FLAG: Flow Policy MaxEnt-RL by Latent Augmented Guidance
Not on the map. Why?
Abstract (arXiv)
Maximum entropy reinforcement learning (MaxEnt-RL) enables robust exploration, yet practical implementations often restrict policies to simple Gaussians. While recent approaches incorporate expressive generative policies via importance-weighted supervised learning, they are prone to importance weight collapse, which limits their scalability in high-dimensional action spaces. Our key insight is to mitigate this limitation by localizing the sampling region, avoiding the weight degeneracy induced by importance sampling over the entire action space. To instantiate this insight, we introduce FLAG (Flow policy with Latent-Augmented Guidance). FLAG augments the state space with a flow latent variable and optimizes a provably consistent proxy MaxEnt-RL objective. We empirically demonstrate that FLAG enables expressive policy optimization with limited importance samples and scales to high-dimensional control tasks. Furthermore, FLAG achieves state-of-the-art performance across challenging benchmarks. Our project webpage: https://flag-rl.github.io/
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 35 of its 49 references that are in the map. First posted on arXiv 29 May 2026.
Builds on
35 of 49 references.
References · 35
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2016Layer Normalizationcited by 5,579
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2015Trust Region Policy Optimizationcited by 2,503
- 2021A Minimalist Approach to Offline Reinforcement Learningcited by 882
- 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 833
- 2019Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learningcited by 750
- 2017A Distributional Perspective on Reinforcement Learningcited by 743
- 2017Reinforcement Learning with Deep Energy-Based Policiescited by 659
- 2020AWAC: Accelerating Online Reinforcement Learning with Offline Datasetscited by 647
23 more
- 2018Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Reviewcited by 466
- 2020dm_control: Software and Tasks for Continuous Controlcited by 368
- 2018Maximum a Posteriori Policy Optimisationcited by 318
- 2024Adjoint Matching: Fine-tuning Flow and Diffusion Generative Models with Memoryless Stochastic Optimal Controlcited by 222
- 2023Learning a Diffusion Model Policy from Rewards via Q-Score Matchingcited by 126
- 2023Policy Representation via Diffusion Probability Model for Reinforcement Learningcited by 105
- 2024Bigger, Regularized, Optimistic: scaling for compute and sample-efficient continuous controlcited by 104
- 2020Mirror Descent Policy Optimizationcited by 102
- 2024Diffusion-based Reinforcement Learning via Q-weighted Variational Policy Optimizationcited by 99
- 2019CrossQ: Batch Normalization in Deep Reinforcement Learning for Greater Sample Efficiency and Simplicitycited by 89
- 2025Flow Matching Policy Gradientscited by 86
- 2024Diffusion Actor-Critic with Entropy Regulatorcited by 81
- 2022MyoSuite -- A contact-rich simulation suite for musculoskeletal motor controlcited by 80
- 2025Efficient Online Reinforcement Learning for Diffusion Policycited by 61
- 2025DIME:Diffusion-Based Maximum Entropy Reinforcement Learningcited by 52
- 2025Flow-Based Policy for Online Reinforcement Learningcited by 33
- 2018Relative Entropy Regularized Policy Iterationcited by 32
- 2025Maximum Entropy Reinforcement Learning with Diffusion Policycited by 29
- 2025One-Step Flow Policy Mirror Descentcited by 18
- 2025GenPO: Generative Diffusion Models Meet On-Policy Reinforcement Learningcited by 16
- 2025Enhanced DACER Algorithm with High Diffusion Efficiencycited by 13
- 2023On the Theory of Risk-Aware Agents: Bridging Actor-Critic and Economicscited by 6
- 2016Importance Sampling with Unequal Supportcited by 5
Built on by
Citing papers per year: 2026: 2.
2 papers.