{"total":33,"rows":[{"id":"2307.13586","title":"Settling the Sample Complexity of Online Reinforcement Learning","created":"2023-07-25","cited_by_count":45,"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":"2302.10371","title":"Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency","created":"2023-02-21","cited_by_count":40,"area":null},{"id":"2112.03432","title":"First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach","created":"2021-12-07","cited_by_count":38,"area":null},{"id":"2104.11186","title":"Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret","created":"2021-04-22","cited_by_count":34,"area":null},{"id":"2107.01264","title":"Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning","created":"2021-07-02","cited_by_count":34,"area":null},{"id":"2207.02575","title":"Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design","created":"2022-07-06","cited_by_count":33,"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":"2102.06875","title":"Improved Corruption Robust Algorithms for Episodic Reinforcement Learning","created":"2021-02-13","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":"2110.14798","title":"Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection","created":"2021-10-27","cited_by_count":18,"area":null},{"id":"2203.09251","title":"Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPs","created":"2022-03-17","cited_by_count":17,"area":null},{"id":"2207.05852","title":"Optimistic PAC Reinforcement Learning: the Instance-Dependent View","created":"2022-07-12","cited_by_count":17,"area":null},{"id":"2302.09408","title":"Best of Both Worlds Policy Optimization","created":"2023-02-18","cited_by_count":17,"area":null},{"id":"2107.08622","title":"Provably Efficient Multi-Task Reinforcement Learning with Model Transfer","created":"2021-07-19","cited_by_count":16,"area":null},{"id":"2106.13013","title":"A Fully Problem-Dependent Regret Lower Bound for Finite-Horizon MDPs","created":"2021-06-24","cited_by_count":15,"area":null},{"id":"2110.13052","title":"Can Q-Learning be Improved with Advice?","created":"2021-10-25","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":"2302.10796","title":"Provably Efficient Exploration in Quantum Reinforcement Learning with Logarithmic Worst-Case Regret","created":"2023-02-21","cited_by_count":9,"area":null},{"id":"2205.11168","title":"Logarithmic regret bounds for continuous-time average-reward Markov decision processes","created":"2022-05-23","cited_by_count":8,"area":null},{"id":"2206.02326","title":"Asymptotic Instance-Optimal Algorithms for Interactive Decision Making","created":"2022-06-06","cited_by_count":7,"area":null},{"id":"2107.00685","title":"Gap-Dependent Bounds for Two-Player Markov Games","created":"2021-07-01","cited_by_count":5,"area":null},{"id":"2206.00796","title":"Stabilizing Q-learning with Linear Architectures for Provably Efficient Learning","created":"2022-06-01","cited_by_count":5,"area":null},{"id":"2201.13170","title":"Cooperative Online Learning in Stochastic and Adversarial MDPs","created":"2022-01-31","cited_by_count":4,"area":null},{"id":"2502.02859","title":"Gap-Dependent Bounds for Federated $Q$-learning","created":"2025-02-05","cited_by_count":4,"area":null},{"id":"2506.06521","title":"Sharp Gap-Dependent Variance-Aware Regret Bounds for Tabular MDPs","created":"2025-06-06","cited_by_count":4,"area":null},{"id":"2205.12418","title":"Tiered Reinforcement Learning: Pessimism in the Face of Uncertainty and Constant Regret","created":"2022-05-25","cited_by_count":3,"area":null},{"id":"2110.05724","title":"Query-Reward Tradeoffs in Multi-Armed Bandits","created":"2021-10-12","cited_by_count":1,"area":null},{"id":"2302.05534","title":"Robust Knowledge Transfer in Tiered Reinforcement Learning","created":"2023-02-10","cited_by_count":1,"area":null},{"id":"2605.20873","title":"PlanningBench: Generating Scalable and Verifiable Planning Data for Evaluating and Training Large Language Models","created":"2026-05-20","cited_by_count":1,"area":null},{"id":"2202.05799","title":"Rate-matching the regret lower-bound in the linear quadratic regulator with unknown dynamics","created":"2022-02-11","cited_by_count":0,"area":null},{"id":"2501.10261","title":"Logarithmic Regret for Nonlinear Control","created":"2025-01-17","cited_by_count":0,"area":null},{"id":"2605.04979","title":"On-line Learning in Tree MDPs by Treating Policies as Bandit Arms","created":"2026-05-06","cited_by_count":0,"area":null}],"next_cursor":null}