Research map / Reinforcement learning / MDPs and planning
Efficient PAC-Optimal Exploration in Concurrent, Continuous State MDPs with Delayed Updates
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
- Bounded Optimal Exploration in MDP (AAAI 2016 · similarity 0.91)
- Improving PAC Exploration Using the Median Of Means (NeurIPS 2016 · similarity 0.89)
- Model-Based Exploration in Monitored Markov Decision Processes (ICML 2025 · similarity 0.84)
- Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs (NeurIPS 2024 · similarity 0.84)
- Deterministic Policy Gradient Primal-Dual Methods for Continuous-Space Constrained MDPs (AAAI 2025 · similarity 0.84)
- Faster Fixed-Point Methods for Multichain MDPs (NeurIPS 2025 · similarity 0.84)
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.