{"total":15,"rows":[{"id":"2102.06548","title":"Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis","created":"2021-02-12","cited_by_count":92,"area":null},{"id":"2110.04645","title":"Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning","created":"2021-10-09","cited_by_count":53,"area":null},{"id":"2203.07368","title":"The Efficacy of Pessimism in Asynchronous Q-Learning","created":"2022-03-14","cited_by_count":42,"area":null},{"id":"2108.03706","title":"Online Bootstrap Inference For Policy Evaluation in Reinforcement Learning","created":"2021-08-08","cited_by_count":26,"area":null},{"id":"2106.13781","title":"Tighter Analysis of Alternating Stochastic Gradient Method for Stochastic Nested Problems","created":"2021-06-25","cited_by_count":22,"area":null},{"id":"2102.11866","title":"Doubly Robust Off-Policy Actor-Critic: Convergence and Optimality","created":"2021-02-23","cited_by_count":21,"area":null},{"id":"2112.13109","title":"Accelerated and instance-optimal policy evaluation with linear function approximation","created":"2021-12-24","cited_by_count":18,"area":null},{"id":"2305.15546","title":"Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time","created":"2023-05-24","cited_by_count":8,"area":null},{"id":"2103.16377","title":"Greedy-GQ with Variance Reduction: Finite-time Analysis and Improved Complexity","created":"2021-03-30","cited_by_count":7,"area":null},{"id":"2103.13147","title":"Multi-Agent Off-Policy TD Learning: Finite-Time Analysis with Near-Optimal Sample Complexity and Communication Complexity","created":"2021-03-24","cited_by_count":5,"area":null},{"id":"2201.08536","title":"Instance-Dependent Confidence and Early Stopping for Reinforcement Learning","created":"2022-01-21","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":"2303.07068","title":"n-Step Temporal Difference Learning with Optimal n","created":"2023-03-13","cited_by_count":2,"area":null},{"id":"2211.16237","title":"Closing the gap between SVRG and TD-SVRG with Gradient Splitting","created":"2022-11-29","cited_by_count":1,"area":null},{"id":"2608.15966","title":"A Banach-Space Theory of Markovian Halpern Iteration for Non-Expansive Maps","created":"2026-08-16","cited_by_count":1,"area":null}],"next_cursor":null}