Probabilistic counterexample guidance for safer reinforcement learning
From MaRDI portal
Publication:6546466
DOI10.1007/978-3-031-43835-6_22MaRDI QIDQ6546466
Publication date: 29 May 2024
Learning and adaptive systems in artificial intelligence (68T05) Markov and semi-Markov decision processes (90C40) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A logic for reasoning about time and reliability
- \({\mathcal Q}\)-learning
- Deep reinforcement learning with temporal logics
- Noise-tolerant distribution-free learning of general geometric concepts
- Safe Exploration of State and Action Spaces in Reinforcement Learning
- Fast polyhedra abstract domain
- Branch-and-Bound Methods: A Survey
- Safety-aware apprenticeship learning
- Certified reinforcement learning with logic guidance
- Counterexample-driven synthesis for probabilistic program sketches
This page was built for publication: Probabilistic counterexample guidance for safer reinforcement learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546466)