Research map / Reinforcement learning / MDPs and planning
Learning in Observable POMDPs, without Computationally Intractable Oracles
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
- Provable Representation with Efficient Planning for Partially Observable Reinforcement Learning (ICML 2024 · similarity 0.92)
- Sequential Monte Carlo for Policy Optimization in Continuous POMDPs (NeurIPS 2025 · similarity 0.91)
- Model-based Reinforcement Learning for Confounded POMDPs (ICML 2024 · similarity 0.91)
- Scalable Policy-Based RL Algorithms for POMDPs (NeurIPS 2025 · similarity 0.90)
- Sample-Efficient Learning of POMDPs with Multiple Observations In Hindsight (ICLR 2024 · similarity 0.90)
- A Policy Gradient Method for Confounded POMDPs (ICLR 2024 · similarity 0.89)
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.