Memory-State Critic for Asymmetric Actor-Critic with Application to Vision-Based Pursuit-Evasion
On the map: Deep reinforcement learning methods → RL theory and sample complexity also fits: Deep RL algorithms and representations
Abstract (arXiv)
In partially observable Markov decision processes, the optimal policy generally depends on the history of observations and past actions. Asymmetric actor-critic methods have become popular to learn such policies when additional information, such as the true state of the environment, is available during training. The critic, which is not needed at execution, is given access to the state. A critic conditioned on the state alone is generally ill-defined and yields biased policy gradients. Conditioning on the state and the history, the history-state critic restores both. In this paper, we show that conditioning the critic on the state and the policy's own memory, i.e., the internal representation of the history through which the policy selects its actions, is already well-defined and gives unbiased policy gradients, removing the need for a second recurrent approximator of the history. We call it the memory state critic. It follows that a critic based on the policy's memory need not backpropagate its loss into that memory, even though the memory is a lossy encoding of the history. We evaluate the memory-state critic in a vision-based pursuit-evasion environment between two quadrotors across two arena types. The pursuer is the learning agent, and the evader is sampled per episode from a fixed pool of heuristic behaviours. The results show that the memory-state critic outperforms the history-state critic and converges faster. In addition to being unbiased compared to the state-only critic, it maintains a slight edge in the wall arena, where the actor's history carries information that the privileged state alone does not.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 18 of its 25 references that are in the map. First posted on arXiv 2 Oct 2026.
Builds on
18 of 25 references.
Closest ancestors · 1
Same direction, newest first
Other references · 17
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2021Deep Reinforcement Learning at the Edge of the Statistical Precipicecited by 807
- 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 465
- 2023Orbit: A Unified Simulation Framework for Interactive Robot Learning Environmentscited by 295
- 2017Asymmetric Actor Critic for Image-Based Robot Learningcited by 238
- 2020Phasic Policy Gradientcited by 123
- 2021Recurrent Model-Free RL Can Be a Strong Baseline for Many POMDPscited by 122
- 2022skrl: Modular and Flexible Library for Reinforcement Learningcited by 49
- 2024Demonstrating Agile Flight from Pixels without State Estimationcited by 31
- 2021Unbiased Asymmetric Reinforcement Learning under Partial Observabilitycited by 25
- 2024A Super-human Vision-based Reinforcement Learning Agent for Autonomous Racing in Gran Turismocited by 15
- 2025Dream to Fly: Model-Based Reinforcement Learning for Vision-Based Drone Flightcited by 15
5 more
- 2023Learning Vision-based Pursuit-Evasion Robot Policiescited by 11
- 2022A Deeper Understanding of State-Based Critics in Multi-Agent Reinforcement Learningcited by 10
- 2025SkyDreamer: Interpretable End-to-End Vision-Based Drone Racing with Model-Based Reinforcement Learningcited by 8
- 2025Depth Transfer: Learning to See Like a Simulator for Real-World Drone Navigationcited by 3
- 2025Learned Controllers for Agile Quadrotors in Pursuit-Evasion Gamescited by 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Informed Asymmetric Actor-Critic: Leveraging Privileged Signals Beyond Full-State Access
- 2026Hidden States as Value Gradients: The Pontryagin Structure of Recurrent Policies
- 2025Partially Observable Reinforcement Learning with Memory Traces
- 2024Mitigating Partial Observability in Sequential Decision Processes via the Lambda Discrepancy
- 2026Why Linear Recurrent Memory Works in Partially Observable Reinforcement Learning
- 2025Benchmarking Partial Observability in Reinforcement Learning with a Suite of Memory-Improvable Domains
- 2026Policy Gradient Methods for Non-Markovian Reinforcement Learning
- 2026Divide-and-Remember: Recursive Action-Relevant Memory for Long-Horizon VLA Policies