Probabilistic guarantees for safe deep reinforcement learning
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3543391 (Why is no real title available?)
- A comprehensive survey on safe reinforcement learning
- A game-based abstraction-refinement framework for Markov decision processes
- Formal Verification and Synthesis for Discrete-Time Stochastic Systems
- Formal verification of piece-wise linear feed-forward neural networks
- Omega-Regular Objectives in Model-Free Reinforcement Learning
- Probabilistic guarantees for safe deep reinforcement learning
- Reluplex: an efficient SMT solver for verifying deep neural networks
- Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agents
- Safety verification of deep neural networks
- Verification of Markov decision processes using learning algorithms
Cited in
(8)- Probabilistic guarantees for safe deep reinforcement learning
- Safe Exploration of State and Action Spaces in Reinforcement Learning
- Probabilistic reach-avoid for Bayesian neural networks
- Iteratively synthesizing \(\epsilon\)-robust barrier certificates for neural network controlled systems
- DMPC: a data-and model-driven approach to predictive control
- Learning safe neural network controllers with barrier certificates
- Dynamic shielding for reinforcement learning in black-box environments
- Safety-constrained reinforcement learning with a distributional safety critic
This page was built for publication: Probabilistic guarantees for safe deep reinforcement learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996032)
