Research map / Reinforcement learning / MDPs and planning
Efficient Planning in Large MDPs with Weak Linear Function Approximation
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
- Confident Approximate Policy Iteration for Efficient Local Planning in $q^\pi$-realizable MDPs (NeurIPS 2022 · similarity 0.91)
- Optimistic Planning by Regularized Dynamic Programming (ICML 2023 · similarity 0.89)
- Confident Natural Policy Gradient for Local Planning in $q_\pi$-realizable Constrained MDPs (NeurIPS 2024 · similarity 0.89)
- Projection-based Lyapunov method for fully heterogeneous weakly-coupled MDPs (NeurIPS 2025 · similarity 0.87)
- Scalable Policy-Based RL Algorithms for POMDPs (NeurIPS 2025 · similarity 0.87)
- Solving Robust Markov Decision Processes: Generic, Reliable, Efficient (AAAI 2025 · similarity 0.87)
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.