linear mdp

Making Linear MDPs Practical via Contrastive Representation Learning ICML 2022 Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation ICML 2022 On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL NeurIPS 2022 Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes ICML 2022 Bilinear Classes: A Structural Framework for Provable Generalization in RL ICML 2021 Fast Rates for the Regret of Offline Reinforcement Learning COLT 2021 Logarithmic Regret for Reinforcement Learning with Linear Function Approximation ICML 2021 Nearly Horizon-Free Offline Reinforcement Learning NeurIPS 2021 Online Sparse Reinforcement Learning AISTATS 2021 Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection NeurIPS 2021 Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model NeurIPS 2021 Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting NeurIPS 2021 Learning Near Optimal Policies with Low Inherent Bellman Error ICML 2020 PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learning NeurIPS 2020