Research map / Reinforcement learning / MDPs and planning
Is Plug-in Solver Sample-Efficient for Feature-based Reinforcement Learning?
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
- Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model (NeurIPS 2021 · similarity 0.92)
- Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model (NeurIPS 2020 · similarity 0.92)
- Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting (NeurIPS 2021 · similarity 0.90)
- Near-Optimal Sample Complexity for MDPs via Anchoring (ICML 2025 · similarity 0.88)
- Optimal Sample Complexity for Average Reward Markov Decision Processes (ICLR 2024 · similarity 0.88)
- Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity (ICLR 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.