{"total":51,"rows":[{"id":"2102.07035","title":"Model-free Representation Learning and Exploration in Low-rank MDPs","created":"2021-02-14","cited_by_count":82,"area":null},{"id":"2205.11140","title":"Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation","created":"2022-05-23","cited_by_count":81,"area":null},{"id":"2206.08332","title":"BYOL-Explore: Exploration by Bootstrapped Prediction","created":"2022-06-16","cited_by_count":73,"area":null},{"id":"2107.08346","title":"Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses","created":"2021-07-18","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":"2101.12745","title":"Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP","created":"2021-01-29","cited_by_count":45,"area":null},{"id":"2111.03289","title":"Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs","created":"2021-11-05","cited_by_count":44,"area":null},{"id":"2103.12690","title":"An Exponential Lower Bound for Linearly-Realizable MDPs with Constant Suboptimality Gap","created":"2021-03-23","cited_by_count":40,"area":null},{"id":"2205.14571","title":"Provable Benefits of Representational Transfer in Reinforcement Learning","created":"2022-05-29","cited_by_count":38,"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":"2107.05216","title":"A Simple Reward-free Approach to Constrained Reinforcement Learning","created":"2021-07-12","cited_by_count":30,"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":"2105.08024","title":"Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting","created":"2021-05-17","cited_by_count":28,"area":null},{"id":"2206.10770","title":"On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL","created":"2022-06-21","cited_by_count":27,"area":null},{"id":"2202.06450","title":"Towards Deployment-Efficient Reinforcement Learning: Lower Bound and Optimality","created":"2022-02-14","cited_by_count":24,"area":null},{"id":"2311.05067","title":"Accelerating Exploration with Unlabeled Prior Data","created":"2023-11-09","cited_by_count":21,"area":null},{"id":"2101.00300","title":"When Is Generalizable Reinforcement Learning Tractable?","created":"2021-01-01","cited_by_count":20,"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.12942","title":"Refined Regret for Adversarial MDPs with Linear Function Approximation","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2105.14016","title":"Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model","created":"2021-05-28","cited_by_count":18,"area":null},{"id":"2107.09912","title":"Design of Experiments for Stochastic Contextual Linear Bandits","created":"2021-07-21","cited_by_count":18,"area":null},{"id":"2307.03997","title":"Efficient Model-Free Exploration in Low-Rank MDPs","created":"2023-07-08","cited_by_count":16,"area":null},{"id":"2105.08285","title":"Sublinear Least-Squares Value Iteration via Locality Sensitive Hashing","created":"2021-05-18","cited_by_count":15,"area":null},{"id":"2304.08944","title":"Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning","created":"2023-04-18","cited_by_count":15,"area":null},{"id":"2110.03244","title":"Near-Optimal Reward-Free Exploration for Linear Mixture MDPs with Plug-in Solver","created":"2021-10-07","cited_by_count":14,"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":"2403.11574","title":"Offline Multitask Representation Learning for Reinforcement Learning","created":"2024-03-18","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":"2202.06545","title":"Provably Efficient Causal Model-Based Reinforcement Learning for Systematic Generalization","created":"2022-02-14","cited_by_count":12,"area":null},{"id":"2110.04422","title":"Theoretically Principled Deep RL Acceleration via Nearest Neighbor Function Approximation","created":"2021-10-09","cited_by_count":11,"area":null},{"id":"2307.04354","title":"Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data","created":"2023-07-10","cited_by_count":11,"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":"2310.06113","title":"When is Agnostic Reinforcement Learning Statistically Tractable?","created":"2023-10-09","cited_by_count":9,"area":null},{"id":"2308.01490","title":"Minimax Optimal Q Learning with Nearest Neighbors","created":"2023-08-03","cited_by_count":8,"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":"2306.10694","title":"On the Model-Misspecification in Reinforcement Learning","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2306.09554","title":"Low-Switching Policy Gradient with Exploration via Online Sensitivity Sampling","created":"2023-06-15","cited_by_count":6,"area":null},{"id":"2202.12797","title":"Learning Dynamic Mechanisms in Unknown Environments: A Reinforcement Learning Approach","created":"2022-02-25","cited_by_count":5,"area":null},{"id":"2401.05193","title":"Experiment Planning with Function Approximation","created":"2024-01-10","cited_by_count":5,"area":null},{"id":"2111.12045","title":"Adaptive Multi-Goal Exploration","created":"2021-11-23","cited_by_count":4,"area":null},{"id":"2303.00177","title":"Finite-sample Guarantees for Nash Q-learning with Linear Function Approximation","created":"2023-03-01","cited_by_count":4,"area":null},{"id":"2508.05441","title":"Tail-Risk-Safe Monte Carlo Tree Search under PAC-Level Guarantees","created":"2025-08-07","cited_by_count":4,"area":null},{"id":"2205.15891","title":"One Policy is Enough: Parallel Exploration with a Single Policy is Near-Optimal for Reward-Free Reinforcement Learning","created":"2022-05-31","cited_by_count":2,"area":null},{"id":"2106.07203","title":"Online Sub-Sampling for Reinforcement Learning with General Function Approximation","created":"2021-06-14","cited_by_count":1,"area":null},{"id":"2201.00236","title":"Operator Deep Q-Learning: Zero-Shot Reward Transferring in Reinforcement Learning","created":"2022-01-01","cited_by_count":1,"area":null},{"id":"2211.15792","title":"Provably Efficient Model-free RL in Leader-Follower MDP with Linear Function Approximation","created":"2022-11-28","cited_by_count":1,"area":null},{"id":"2307.05834","title":"Scaling Distributed Multi-task Reinforcement Learning with Experience Sharing","created":"2023-07-11","cited_by_count":1,"area":null},{"id":"2301.03142","title":"Exploration in Model-based Reinforcement Learning with Randomized Reward","created":"2023-01-09","cited_by_count":0,"area":null},{"id":"2602.01453","title":"The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration","created":"2026-02-01","cited_by_count":0,"area":null}],"next_cursor":null}