Research map / Bandits and online learning / RL theory and MDPs
Reinforcement Learning in Factored MDPs: Oracle-Efficient Algorithms and Tighter Regret Bounds for the Non-Episodic Setting
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
- Oracle-Efficient Regret Minimization in Factored MDPs with Unknown Structure (NeurIPS 2021 · similarity 0.93)
- Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling (ICML 2024 · similarity 0.90)
- Overcoming the Curse of Dimensionality in Reinforcement Learning Through Approximate Factorization (ICML 2025 · similarity 0.89)
- No-Regret Reinforcement Learning in Smooth MDPs (ICML 2024 · similarity 0.88)
- Achieving Tractable Minimax Optimal Regret in Average Reward MDPs (NeurIPS 2024 · similarity 0.88)
- Efficient Reinforcement Learning in Probabilistic Reward Machines (AAAI 2025 · 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.