{"total":22,"rows":[{"id":"2205.11507","title":"Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs","created":"2022-05-23","cited_by_count":52,"area":null},{"id":"2201.11206","title":"Reward-Free RL is No Harder Than Reward-Aware RL in Linear Markov Decision Processes","created":"2022-01-26","cited_by_count":49,"area":null},{"id":"2108.02717","title":"Beyond No Regret: Instance-Dependent PAC Reinforcement Learning","created":"2021-08-05","cited_by_count":41,"area":null},{"id":"2202.06385","title":"Sample-Efficient Reinforcement Learning with loglog(T) Switching Cost","created":"2022-02-13","cited_by_count":32,"area":null},{"id":"2110.06394","title":"Reward-Free Model-Based Reinforcement Learning with Linear Function Approximation","created":"2021-10-12","cited_by_count":29,"area":null},{"id":"2203.12922","title":"Horizon-Free Reinforcement Learning in Polynomial Time: the Power of Stationary Policies","created":"2022-03-24","cited_by_count":27,"area":null},{"id":"2110.09771","title":"On Reward-Free RL with Kernel and Neural Function Approximations: Single-Agent MDP and Markov Game","created":"2021-10-19","cited_by_count":20,"area":null},{"id":"2301.13446","title":"Sharp Variance-Dependent Bounds in Reinforcement Learning: Best of Both Worlds in Stochastic and Deterministic Environments","created":"2023-01-31","cited_by_count":19,"area":null},{"id":"2111.00633","title":"Settling the Horizon-Dependence of Sample Complexity in Reinforcement Learning","created":"2021-11-01","cited_by_count":18,"area":null},{"id":"2303.10859","title":"Improved Sample Complexity for Reward-free Reinforcement Learning under Low-rank MDPs","created":"2023-03-20","cited_by_count":14,"area":null},{"id":"2210.00701","title":"Near-Optimal Deployment Efficiency in Reward-Free Reinforcement Learning with Linear Function Approximation","created":"2022-10-03","cited_by_count":13,"area":null},{"id":"2108.05439","title":"Gap-Dependent Unsupervised Exploration for Reinforcement Learning","created":"2021-08-11","cited_by_count":10,"area":null},{"id":"2206.14057","title":"Safe Exploration Incurs Nearly No Additional Sample Complexity for Reward-free RL","created":"2022-06-28","cited_by_count":10,"area":null},{"id":"2405.17796","title":"Offline Oracle-Efficient Learning for Contextual MDPs via Layerwise Exploration-Exploitation Tradeoff","created":"2024-05-28","cited_by_count":8,"area":null},{"id":"2303.10165","title":"Optimal Horizon-Free Reward-Free Exploration for Linear Mixture MDPs","created":"2023-03-17","cited_by_count":7,"area":null},{"id":"2111.12045","title":"Adaptive Multi-Goal Exploration","created":"2021-11-23","cited_by_count":4,"area":null},{"id":"2203.06587","title":"Policy Learning for Robust Markov Decision Process with a Mismatched Generative Model","created":"2022-03-13","cited_by_count":4,"area":null},{"id":"2210.04946","title":"Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path","created":"2022-10-10","cited_by_count":4,"area":null},{"id":"2210.05355","title":"Multi-User Reinforcement Learning with Low Rank Rewards","created":"2022-10-11","cited_by_count":4,"area":null},{"id":"2210.11604","title":"Horizon-Free and Variance-Dependent Reinforcement Learning for Latent Markov Decision Processes","created":"2022-10-20","cited_by_count":4,"area":null},{"id":"2305.08359","title":"Horizon-free Reinforcement Learning in Adversarial Linear Mixture MDPs","created":"2023-05-15","cited_by_count":4,"area":null},{"id":"2202.07995","title":"Branching Reinforcement Learning","created":"2022-02-16","cited_by_count":2,"area":null}],"next_cursor":null}