{"total":57,"rows":[{"id":"2109.14523","title":"Online Robust Reinforcement Learning with Model Uncertainty","created":"2021-09-29","cited_by_count":96,"area":null},{"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":"2105.15186","title":"Fast Policy Extragradient Methods for Competitive Games with Entropy Regularization","created":"2021-05-31","cited_by_count":63,"area":null},{"id":"2102.01567","title":"A Lyapunov Theory for Finite-Sample Guarantees of Asynchronous Q-Learning and TD-Learning Variants","created":"2021-02-02","cited_by_count":57,"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":"2102.01168","title":"Reinforcement Learning for Selective Key Applications in Power Systems: Recent Advances and Future Challenges","created":"2021-01-27","cited_by_count":50,"area":null},{"id":"2210.01400","title":"Linear Convergence of Natural Policy Gradient Methods with Log-Linear Policies","created":"2022-10-04","cited_by_count":46,"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":"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.00198","title":"Gradient play in stochastic games: stationary points, convergence, and sample complexity","created":"2021-06-01","cited_by_count":34,"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":"2203.02628","title":"Target Network and Truncation Overcome The Deadly Triad in $Q$-Learning","created":"2022-03-05","cited_by_count":31,"area":null},{"id":"2306.05483","title":"On the Importance of Exploration for Generalization in Reinforcement Learning","created":"2023-06-08","cited_by_count":31,"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":"2105.08024","title":"Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting","created":"2021-05-17","cited_by_count":28,"area":null},{"id":"2102.09318","title":"Finite-Sample Analysis of Off-Policy Natural Actor-Critic Algorithm","created":"2021-02-18","cited_by_count":26,"area":null},{"id":"2303.15740","title":"Concentration of Contractive Stochastic Approximation: Additive and Multiplicative Noise","created":"2023-03-28","cited_by_count":26,"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":"2103.12158","title":"Convergence of Finite Memory Q-Learning for POMDPs and Near Optimality of Learned Policies under Filter Stability","created":"2021-03-22","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":"2105.14016","title":"Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model","created":"2021-05-28","cited_by_count":18,"area":null},{"id":"2310.16173","title":"On the Convergence and Sample Complexity Analysis of Deep Q-Networks with $\\epsilon$-Greedy Exploration","created":"2023-10-24","cited_by_count":17,"area":null},{"id":"2102.08583","title":"A Discrete-Time Switching System Analysis of Q-learning","created":"2021-02-17","cited_by_count":16,"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":"2302.06834","title":"Improved Regret Bounds for Linear Adversarial MDPs via Linear Optimization","created":"2023-02-14","cited_by_count":15,"area":null},{"id":"2303.03100","title":"A Finite-Sample Analysis of Payoff-Based Independent Learning in Zero-Sum Stochastic Games","created":"2023-03-03","cited_by_count":15,"area":null},{"id":"2305.17568","title":"Scalable Primal-Dual Actor-Critic Method for Safe Multi-Agent RL with General Utilities","created":"2023-05-27","cited_by_count":15,"area":null},{"id":"2305.18443","title":"Off-Policy RL Algorithms Can be Sample-Efficient for Continuous Control via Sample Multiple Reuse","created":"2023-05-29","cited_by_count":12,"area":null},{"id":"2302.01248","title":"Robust Markov Decision Processes without Model Estimation","created":"2023-02-02","cited_by_count":11,"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":"2412.00661","title":"Mean-Field Sampling for Cooperative Multi-Agent Reinforcement Learning","created":"2024-12-01","cited_by_count":9,"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":"2112.04213","title":"Convergence Results For Q-Learning With Experience Replay","created":"2021-12-08","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":"2207.06147","title":"A Near-Optimal Primal-Dual Method for Off-Policy Learning in CMDP","created":"2022-07-13","cited_by_count":5,"area":null},{"id":"2408.05686","title":"The Bandit Whisperer: Communication Learning for Restless Bandits","created":"2024-08-11","cited_by_count":5,"area":null},{"id":"2112.07859","title":"Finite-Sample Analysis of Decentralized Q-Learning for Stochastic Games","created":"2021-12-15","cited_by_count":4,"area":null},{"id":"2207.12217","title":"Finite-Time Analysis of Asynchronous Q-learning under Diminishing Step-Size from Control-Theoretic View","created":"2022-07-25","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":"2509.18964","title":"Central Limit Theorems for Asynchronous Averaged Q-Learning","created":"2025-09-23","cited_by_count":4,"area":null},{"id":"2208.03247","title":"An Approximate Policy Iteration Viewpoint of Actor-Critic Algorithms","created":"2022-08-05","cited_by_count":3,"area":null},{"id":"2211.07675","title":"On the Global Convergence of Fitted Q-Iteration with Two-layer Neural Network Parametrization","created":"2022-11-14","cited_by_count":3,"area":null},{"id":"2306.05700","title":"Finite-Time Analysis of Minimax Q-Learning for Two-Player Zero-Sum Markov Games: Switching System Approach","created":"2023-06-09","cited_by_count":3,"area":null},{"id":"2110.02421","title":"Explaining Off-Policy Actor-Critic From A Bias-Variance Perspective","created":"2021-10-06","cited_by_count":2,"area":null},{"id":"2302.07938","title":"Scalable Multi-Agent Reinforcement Learning with General Utilities","created":"2023-02-15","cited_by_count":2,"area":null},{"id":"2307.07666","title":"Efficient Action Robust Reinforcement Learning with Probabilistic Policy Execution Uncertainty","created":"2023-07-15","cited_by_count":2,"area":null},{"id":"2606.24981","title":"A Single Stepsize Suffices for Unprojected Linear TD(0): Simultaneous Robust and Fast Rates via Polyak--Ruppert Averaging","created":"2026-06-23","cited_by_count":2,"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":"2204.10479","title":"Finite-Time Accuracy of Temporal-Difference Learning Under Schur-Stable Recursions","created":"2022-04-22","cited_by_count":0,"area":null},{"id":"2305.06657","title":"On Practical Robust Reinforcement Learning: Practical Uncertainty Set and Double-Agent Algorithm","created":"2023-05-11","cited_by_count":0,"area":null},{"id":"2401.06710","title":"Model-Free Approximate Bayesian Learning for Large-Scale Conversion Funnel Optimization","created":"2024-01-12","cited_by_count":0,"area":null},{"id":"2512.17265","title":"A Theoretical Analysis of State Similarity Between Markov Decision Processes","created":"2025-12-19","cited_by_count":0,"area":null},{"id":"2606.20356","title":"Robust $Q$-learning for mean-field control under Wasserstein uncertainty in common noise","created":"2026-06-18","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}