Research map / Reinforcement learning / MDPs and planning

Horizon-free Learning for Markov Decision Processes and Games: Stochastically Bounded Rewards and Improved Bounds

ICML 2023 · Reinforcement learning › MDPs and planning · approach: Average-reward and regularized 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

• Improved Bounds for Reward-Agnostic and Reward-Free Exploration (ICML 2026 · similarity 0.92)
• REINFORCE Converges to Optimal Policies with Any Learning Rate (NeurIPS 2025 · similarity 0.90)
• Nearly Horizon-Free Offline Reinforcement Learning (NeurIPS 2021 · similarity 0.90)
• Horizon-Free Regret for Linear Markov Decision Processes (ICLR 2024 · similarity 0.90)
• Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games (ICML 2024 · similarity 0.89)
• Efficient Reinforcement Learning in Probabilistic Reward Machines (AAAI 2025 · similarity 0.89)