Research map / Reinforcement learning / MDPs and planning
Reinforcement Learning for Reachability: Guaranteeing Asymptotic Optimality
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Reinforcement Learning from Reachability Specifications: PAC Guarantees with Expected Conditional Distance (ICML 2024 · similarity 0.93)
- Computably Continuous Reinforcement-Learning Objectives Are PAC-Learnable (AAAI 2023 · similarity 0.91)
- Oracle-Efficient Reinforcement Learning for Max Value Ensembles (NeurIPS 2024 · similarity 0.89)
- DARLING: Detection Augmented Reinforcement Learning with Non-Stationary Guarantees (NeurIPS 2026 · similarity 0.89)
- Polynomial-Time Approximability of Constrained Reinforcement Learning (ICML 2025 · similarity 0.89)
- A PAC Learning Algorithm for LTL and Omega-Regular Objectives in MDPs (AAAI 2024 · similarity 0.88)
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.