{"total":51,"rows":[{"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":"2305.16589","title":"The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model","created":"2023-05-26","cited_by_count":52,"area":null},{"id":"2307.13586","title":"Settling the Sample Complexity of Online Reinforcement Learning","created":"2023-07-25","cited_by_count":45,"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":"2302.13203","title":"A Finite Sample Complexity Bound for Distributionally Robust Q-learning","created":"2023-02-26","cited_by_count":36,"area":null},{"id":"2305.10697","title":"The Blessing of Heterogeneity in Federated Q-Learning: Linear Speedup and Beyond","created":"2023-05-18","cited_by_count":36,"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":"2112.14582","title":"A Statistical Analysis of Polyak-Ruppert Averaged Q-learning","created":"2021-12-29","cited_by_count":29,"area":null},{"id":"2305.18420","title":"Sample Complexity of Variance-reduced Distributionally Robust Q-learning","created":"2023-05-28","cited_by_count":29,"area":null},{"id":"2306.16394","title":"Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes","created":"2023-06-28","cited_by_count":29,"area":null},{"id":"2106.14308","title":"Concentration of Contractive Stochastic Approximation and Reinforcement Learning","created":"2021-06-27","cited_by_count":23,"area":null},{"id":"2105.12540","title":"Finite-Sample Analysis of Off-Policy Natural Actor-Critic with Linear Function Approximation","created":"2021-05-26","cited_by_count":22,"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":"2110.08440","title":"Online Target Q-learning with Reverse Experience Replay: Efficiently finding the Optimal Policy for Linear MDPs","created":"2021-10-16","cited_by_count":19,"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":"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":"2310.08833","title":"Optimal Sample Complexity for Average Reward Markov Decision Processes","created":"2023-10-13","cited_by_count":15,"area":null},{"id":"2306.06836","title":"Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds","created":"2023-06-12","cited_by_count":14,"area":null},{"id":"2205.14211","title":"KL-Entropy-Regularized RL with a Generative Model is Minimax Optimal","created":"2022-05-27","cited_by_count":13,"area":null},{"id":"2312.10424","title":"A Concentration Bound for TD(0) with Function Approximation","created":"2023-12-16","cited_by_count":10,"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":"2308.01490","title":"Minimax Optimal Q Learning with Nearest Neighbors","created":"2023-08-03","cited_by_count":8,"area":null},{"id":"2206.03569","title":"Overcoming the Long Horizon Barrier for Sample-Efficient Reinforcement Learning with Latent Low-Rank Structure","created":"2022-06-07","cited_by_count":7,"area":null},{"id":"2306.08719","title":"Off-policy Evaluation in Doubly Inhomogeneous Environments","created":"2023-06-14","cited_by_count":7,"area":null},{"id":"2502.14172","title":"A Finite Sample Analysis of Distributional TD Learning with Linear Function Approximation","created":"2025-02-20","cited_by_count":6,"area":null},{"id":"2112.04213","title":"Convergence Results For Q-Learning With Experience Replay","created":"2021-12-08","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":"2207.11143","title":"Towards Global Optimality in Cooperative MARL with the Transformation And Distillation Framework","created":"2022-07-12","cited_by_count":5,"area":null},{"id":"2403.09701","title":"A Natural Extension To Online Algorithms For Hybrid RL With Limited Coverage","created":"2024-03-07","cited_by_count":5,"area":null},{"id":"2408.08192","title":"Stochastic Semi-Gradient Descent for Learning Mean Field Games with Population-Aware Function Approximation","created":"2024-08-15","cited_by_count":5,"area":null},{"id":"2203.11489","title":"A Note on Target Q-learning For Solving Finite MDPs with A Generative Oracle","created":"2022-03-22","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":"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":"2508.01681","title":"Generalized Kernelized Bandits: A Novel Self-Normalized Bernstein-Like Dimension-Free Inequality and Regret Bounds","created":"2025-08-03","cited_by_count":4,"area":null},{"id":"2405.19811","title":"Approximate Global Convergence of Independent Learning in Multi-Agent Systems","created":"2024-05-30","cited_by_count":3,"area":null},{"id":"2407.06712","title":"MDP Geometry, Normalization and Reward Balancing Solvers","created":"2024-07-09","cited_by_count":3,"area":null},{"id":"2405.03718","title":"A Single Online Agent Can Efficiently Learn Mean Field Games","created":"2024-05-05","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":"2205.08422","title":"JUNO: Jump-Start Reinforcement Learning-based Node Selection for UWB Indoor Localization","created":"2022-05-06","cited_by_count":1,"area":null},{"id":"2306.12981","title":"Achieving Sample and Computational Efficient Reinforcement Learning by Action Space Reduction via Grouping","created":"2023-06-22","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":"2604.07323","title":"Gaussian Approximation for Asynchronous Q-learning","created":"2026-04-08","cited_by_count":1,"area":null},{"id":"2606.25170","title":"Minimax PAC Bounds for Learning in Exogenous Contextual MDPs","created":"2026-06-23","cited_by_count":1,"area":null},{"id":"2609.09480","title":"Gaussian Approximation in Wasserstein-p: Markovian Martingale Differences and Stochastic Approximation","created":"2026-09-08","cited_by_count":1,"area":null},{"id":"2609.38880","title":"Near-Minimax-Optimal Rates for Asynchronous TD Learning with Markovian Data","created":"2026-09-30","cited_by_count":1,"area":null},{"id":"2111.02644","title":"A Concentration Bound for LSPE($\\lambda$)","created":"2021-11-04","cited_by_count":0,"area":null},{"id":"2405.04026","title":"Federated Control in Markov Decision Processes","created":"2024-05-07","cited_by_count":0,"area":null},{"id":"2605.17678","title":"On Gaussian approximation for entropy-regularized Q-learning with function approximation","created":"2026-05-17","cited_by_count":0,"area":null},{"id":"2607.17595","title":"Concentration and Mean-Square Bounds for Contractive Stochastic Approximation: A Unified Elementary Approach","created":"2026-07-20","cited_by_count":0,"area":null}],"next_cursor":null}