Research map / Reinforcement learning / MDPs and planning
Finding Safe Zones of Markov Decision Processes Policies
Lee Cohen, Yishay Mansour, Michal Moshkovitz
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use FINDING SAFEZONE instead of GREEDY for small set size k=60 | SafeZone selection · Grid MDP N=30 | coverage: 0 -> larger than 0 | Improved |
| use FINDING SAFEZONE instead of GREEDY and SIMULATION | SafeZone selection · Grid MDP N=30, 2000 test trajectories | trajectory coverage | Improved |
| switch policy to go to the middle first and then right | grid policy · Grid MDP N=30 | states needed for same safety | Improved |
Closest papers by meaning
- Flipping-based Policy for Chance-Constrained Markov Decision Processes (NeurIPS 2024 · similarity 0.87)
- SaVeR: Optimal Data Collection Strategy for Safe Policy Evaluation in Tabular MDP (ICML 2024 · similarity 0.86)
- Probabilistic Shielding for Safe Reinforcement Learning (AAAI 2025 · similarity 0.86)
- Near-Optimal Sample Complexity for Online Constrained MDPs (NeurIPS 2025 · similarity 0.86)
- Finding good policies in average-reward Markov Decision Processes without prior knowledge (NeurIPS 2024 · similarity 0.86)
- Long-Term Safe Reinforcement Learning with Binary Feedback (AAAI 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
