Research map / Reinforcement learning / MDPs and planning
Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithms
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
- Understanding the Eluder Dimension (NeurIPS 2022 · similarity 0.89)
- Computationally Efficient RL under Linear Bellman Completeness for Deterministic Dynamics (ICLR 2025 · similarity 0.88)
- Contextual Decision Processes with low Bellman rank are PAC-Learnable (ICML 2017 · similarity 0.88)
- Eluder dimension: localise it! (NeurIPS 2025 · similarity 0.88)
- Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL (ICML 2024 · similarity 0.88)
- UFO-RL: Uncertainty-Focused Optimization for Efficient Reinforcement Learning Data Selection (NeurIPS 2025 · similarity 0.86)
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.