{"total":30,"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.02717","title":"Beyond No Regret: Instance-Dependent PAC Reinforcement Learning","created":"2021-08-05","cited_by_count":41,"area":null},{"id":"2205.05800","title":"Stochastic first-order methods for average-reward Markov decision processes","created":"2022-05-11","cited_by_count":32,"area":null},{"id":"2210.00953","title":"Bias and Extrapolation in Markovian Linear Stochastic Approximation with Constant Stepsizes","created":"2022-10-03","cited_by_count":30,"area":null},{"id":"2112.14582","title":"A Statistical Analysis of Polyak-Ruppert Averaged Q-learning","created":"2021-12-29","cited_by_count":29,"area":null},{"id":"2404.18909","title":"Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty","created":"2024-04-29","cited_by_count":25,"area":null},{"id":"2109.12002","title":"Optimal policy evaluation using kernel-based temporal difference methods","created":"2021-09-24","cited_by_count":24,"area":null},{"id":"2106.14352","title":"Instance-optimality in optimal value estimation: Adaptivity via variance-reduced Q-learning","created":"2021-06-28","cited_by_count":22,"area":null},{"id":"2310.14286","title":"Improved High-Probability Bounds for the Temporal Difference Learning Algorithm via Exponential Stability","created":"2023-10-22","cited_by_count":20,"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":"2205.10671","title":"Pessimism for Offline Linear Contextual Bandits using $\\ell_p$ Confidence Sets","created":"2022-05-21","cited_by_count":18,"area":null},{"id":"2201.08518","title":"Optimal variance-reduced stochastic approximation in Banach spaces","created":"2022-01-21","cited_by_count":17,"area":null},{"id":"2305.19001","title":"High-probability sample complexities for policy evaluation with linear function approximation","created":"2023-05-30","cited_by_count":16,"area":null},{"id":"2208.10458","title":"Minimax-Optimal Multi-Agent RL in Markov Games With a Generative Model","created":"2022-08-22","cited_by_count":15,"area":null},{"id":"2302.01248","title":"Robust Markov Decision Processes without Model Estimation","created":"2023-02-02","cited_by_count":11,"area":null},{"id":"2301.13289","title":"On the Statistical Benefits of Temporal Difference Learning","created":"2023-01-30","cited_by_count":8,"area":null},{"id":"2303.05606","title":"Variance-aware robust reinforcement learning with linear function approximation under heavy-tailed rewards","created":"2023-03-09","cited_by_count":8,"area":null},{"id":"2407.05966","title":"On Bellman equations for continuous-time policy evaluation I: discretization and approximation","created":"2024-07-08","cited_by_count":7,"area":null},{"id":"2302.07477","title":"Optimal Sample Complexity of Stable Discounted Markov Decision Processes","created":"2023-02-15","cited_by_count":6,"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":"2505.21796","title":"A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging","created":"2025-05-27","cited_by_count":4,"area":null},{"id":"2210.11377","title":"Krylov-Bellman boosting: Super-linear policy evaluation in general state spaces","created":"2022-10-20","cited_by_count":2,"area":null},{"id":"2601.01502","title":"Multiscale replay: A robust algorithm for stochastic variational inequalities with a Markovian buffer","created":"2026-01-04","cited_by_count":2,"area":null},{"id":"2404.00042","title":"Stochastic Optimization with Constraints: A Non-asymptotic Instance-Dependent Analysis","created":"2024-03-24","cited_by_count":1,"area":null},{"id":"2511.12688","title":"Accelerated Distributional Temporal Difference Learning with Linear Function Approximation","created":"2025-11-16","cited_by_count":1,"area":null},{"id":"2407.10955","title":"Enhancing Stochastic Optimization for Statistical Efficiency Using ROOT-SGD with Diminishing Stepsize","created":"2024-07-15","cited_by_count":0,"area":null},{"id":"2605.27946","title":"Is Backpropagation Optimal? When Synthetic Gradients Improve Sample Efficiency","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.05967","title":"Fast and Robust Convergence Rate for TD(0) with Linear Function Approximation, Universal Learning Steps and I.I.D. Samples","created":"2026-06-04","cited_by_count":0,"area":null}],"next_cursor":null}