Research map / Learning theory and algorithms / Sample complexity
Confident Approximate Policy Iteration for Efficient Local Planning in $q^\pi$-realizable MDPs
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 Natural Policy Gradient for Local Planning in $q_\pi$-realizable Constrained MDPs (NeurIPS 2024 · similarity 0.89)
- Augmented Lagrangian Method for Last-Iterate Convergence for Constrained MDPs (NeurIPS 2026 · similarity 0.89)
- Formally Verified Approximate Policy Iteration (AAAI 2025 · similarity 0.88)
- Polynomial-Time Approximability of Constrained Reinforcement Learning (ICML 2025 · similarity 0.88)
- Scalable Policy-Based RL Algorithms for POMDPs (NeurIPS 2025 · similarity 0.87)
- Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time (NeurIPS 2024 · 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.