Research map / Bandits and online learning / RL theory and MDPs
Is Pure Exploitation Sufficient in Exogenous MDPs with 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
- Exploration Bonus for Regret Minimization in Discrete and Continuous Average Reward MDPs (NeurIPS 2019 · similarity 0.87)
- Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes (NeurIPS 2018 · similarity 0.87)
- Contextual Decision-Making with Knapsacks Beyond the Worst Case (NeurIPS 2024 · similarity 0.86)
- Causal Bandits: The Pareto Optimal Frontier of Adaptivity, a Reduction to Linear Bandits, and Limitations around Unknown Marginals (ICML 2024 · similarity 0.85)
- Achieving Tractable Minimax Optimal Regret in Average Reward MDPs (NeurIPS 2024 · similarity 0.85)
- Dynamic Regret of Adversarial MDPs with Unknown Transition and Linear Function Approximation (AAAI 2024 · similarity 0.85)
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.