Research map / Learning theory and algorithms / Sample complexity
Reducing Blackwell and Average Optimality to Discounted MDPs via the Blackwell Discount Factor
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
- Near-Optimal Sample Complexity for MDPs via Anchoring (ICML 2025 · similarity 0.88)
- Thresholds for sensitive optimality and Blackwell optimality in stochastic games (NeurIPS 2025 · similarity 0.88)
- Finding good policies in average-reward Markov Decision Processes without prior knowledge (NeurIPS 2024 · similarity 0.88)
- The Number of Trials Matters in Infinite-Horizon General-Utility Markov Decision Processes (ICML 2025 · similarity 0.87)
- Optimal Non-Asymptotic Rates of Value Iteration for Average-Reward Markov Decision Processes (ICLR 2025 · similarity 0.87)
- Achieving Tractable Minimax Optimal Regret in Average Reward MDPs (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.