{"total":22,"rows":[{"id":"2108.02717","title":"Beyond No Regret: Instance-Dependent PAC Reinforcement Learning","created":"2021-08-05","cited_by_count":41,"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":"2303.08059","title":"Fast Rates for Maximum Entropy Exploration","created":"2023-03-14","cited_by_count":33,"area":null},{"id":"2106.02847","title":"Navigating to the Best Policy in Markov Decision Processes","created":"2021-06-05","cited_by_count":29,"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":"2406.01234","title":"Achieving Tractable Minimax Optimal Regret in Average Reward MDPs","created":"2024-06-03","cited_by_count":15,"area":null},{"id":"2209.14414","title":"Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guarantees","created":"2022-09-28","cited_by_count":12,"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":"2410.22908","title":"Federated UCBVI: Communication-Efficient Federated Regret Minimization with Heterogeneous Agents","created":"2024-10-30","cited_by_count":6,"area":null},{"id":"2502.02516","title":"Adaptive Exploration for Multi-Reward Multi-Policy Evaluation","created":"2025-02-04","cited_by_count":6,"area":null},{"id":"2306.06265","title":"Near-optimal Conservative Exploration in Reinforcement Learning under Episode-wise Constraints","created":"2023-06-09","cited_by_count":5,"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":"2310.13393","title":"Optimal Best Arm Identification with Fixed Confidence in Restless Bandits","created":"2023-10-20","cited_by_count":3,"area":null},{"id":"2503.21224","title":"Efficient Learning for Entropy-Regularized Markov Decision Processes via Multilevel Monte Carlo","created":"2025-03-27","cited_by_count":3,"area":null},{"id":"2505.15342","title":"Policy Testing in Markov Decision Processes","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2602.17587","title":"Asymptotically Optimal Sequential Testing with Markovian Data","created":"2026-02-19","cited_by_count":2,"area":null},{"id":"2609.06484","title":"Second-Order Smooth Planning with Optimal-Transport Bellman Smoothing","created":"2026-09-06","cited_by_count":1,"area":null},{"id":"2601.22600","title":"An Efficient Algorithm for Thresholding Monte Carlo Tree Search","created":"2026-01-30","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}