Research map / Reinforcement learning / MDPs and planning

Towards Minimax Optimal Reward-free Reinforcement Learning in Linear MDPs

ICLR 2023 · Reinforcement learning › MDPs and planning · approach: Offline RL sample complexity

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

• Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation (NeurIPS 2021 · similarity 0.95)
• Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation (ICML 2022 · similarity 0.94)
• Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs (ICML 2023 · similarity 0.93)
• Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes (ICML 2022 · similarity 0.93)
• Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes (ICML 2023 · similarity 0.93)
• A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs (ICML 2025 · similarity 0.90)