A Survey on the Verification of Reinforcement Learning Policies
Not on the map. Why?
Abstract (arXiv)
Reinforcement learning (RL) is increasingly applied in complex, safety-critical domains, yet the lack of rigorous behavioral guarantees for neural network-based policies remains a major barrier to deployment. Recent advances in policy expressiveness and scale have intensified this challenge, leading to a rapidly growing but conceptually fragmented body of work on RL policy verification. This survey provides a unifying perspective on RL verification methods. We introduce a taxonomy that clarifies relationships among existing approaches along three axes: verification paradigm (formal versus probabilistic), temporal scope (step-wise versus multi-step), and guarantees strength. Beyond taxonomy, we unify underlying theoretical foundations, make implicit assumptions and limitations explicit, and identify emerging directions.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 31 of its 53 references that are in the map. First posted on arXiv 14 May 2026.
Builds on
31 of 53 references.
References · 31
- 2013Intriguing properties of neural networkscited by 5,114
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
- 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
- 2016Control Barrier Function Based Quadratic Programs for Safety Critical Systemscited by 261
- 2018Towards Fast Computation of Certified Robustness for ReLU Networkscited by 254
- 2021Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verificationcited by 224
- 2019Algorithms for Verifying Deep Neural Networkscited by 221
- 2020Benchmarking Multi-Agent Deep Reinforcement Learning Algorithms in Cooperative Taskscited by 207
- 2018Formal Security Analysis of Neural Networks using Symbolic Intervalscited by 185
- 2020Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifierscited by 183
- 2017An approach to reachability analysis for feed-forward ReLU neural networkscited by 126
19 more
- 2024Marabou 2.0: A Versatile Formal Analyzer of Neural Networkscited by 81
- 2019Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guaranteescited by 77
- 2021Reachability Analysis of Neural Feedback Loopscited by 41
- 2023The Fourth International Verification of Neural Networks Competition (VNN-COMP 2023): Summary and Resultscited by 38
- 2023Provably Bounding Neural Network Preimagescited by 28
- 2023A DPLL(T) Framework for Verifying Deep Neural Networkscited by 23
- 2024Lyapunov-stable Neural Control for State and Output Feedback: A Novel Formulationcited by 23
- 2023The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networkscited by 19
- 2023Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guaranteescited by 19
- 2024Verification of Neural Control Barrier Functions with Symbolic Derivative Bounds Propagationcited by 12
- 2023Safe Deep Reinforcement Learning by Verifying Task-Level Propertiescited by 9
- 2024Neural Network Verification with PyRATcited by 9
- 2024PREMAP: A Unifying PREiMage APproximation Framework for Neural Networkscited by 8
- 2025RL2Grid: Benchmarking Reinforcement Learning in Power Grid Operationscited by 8
- 2024ModelVerification.jl: a Comprehensive Toolbox for Formally Verifying Deep Neural Networkscited by 7
- 2025Designing Control Barrier Function via Probabilistic Enumeration for Safe Reinforcement Learning Navigationcited by 3
- 2025On the Probabilistic Learnability of Compact Neural Network Preimage Boundscited by 3
- 2025Exact Upper and Lower Bounds for the Output Distribution of Neural Networks with Random Inputscited by 2
- 2025Probabilistically Tightened Linear Relaxation-based Perturbation Analysis for Neural Network Verificationcited by 2
Built on by
Not cited yet.