{"total":11,"rows":[{"id":"2307.13586","title":"Settling the Sample Complexity of Online Reinforcement Learning","created":"2023-07-25","cited_by_count":45,"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":"2110.13052","title":"Can Q-Learning be Improved with Advice?","created":"2021-10-25","cited_by_count":13,"area":null},{"id":"2306.13601","title":"Active Coverage for PAC Reinforcement Learning","created":"2023-06-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":"2311.05638","title":"Towards Instance-Optimality in Online PAC Reinforcement Learning","created":"2023-10-31","cited_by_count":7,"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":"2212.09429","title":"On the Complexity of Representation Learning in Contextual Linear Bandits","created":"2022-12-19","cited_by_count":2,"area":null},{"id":"2110.05724","title":"Query-Reward Tradeoffs in Multi-Armed Bandits","created":"2021-10-12","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}],"next_cursor":null}