{"total":58,"rows":[{"id":"2202.13890","title":"Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity","created":"2022-02-28","cited_by_count":85,"area":"offlinerl"},{"id":"2102.01748","title":"Near-Optimal Offline Reinforcement Learning via Double Variance Reduction","created":"2021-02-02","cited_by_count":56,"area":"offlinerl"},{"id":"2110.14074","title":"Fault-Tolerant Federated Reinforcement Learning with Theoretical Guarantee","created":"2021-10-26","cited_by_count":54,"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":"2101.08862","title":"Breaking the Deadly Triad with a Target Network","created":"2021-01-21","cited_by_count":47,"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":"2105.03793","title":"Stability and Generalization of Stochastic Gradient Methods for Minimax Problems","created":"2021-05-08","cited_by_count":36,"area":null},{"id":"2102.09907","title":"Instrumental Variable Value Iteration for Causal Offline Reinforcement Learning","created":"2021-02-19","cited_by_count":35,"area":"offlinerl"},{"id":"2210.03096","title":"Accelerated Single-Call Methods for Constrained Min-Max Optimization","created":"2022-10-06","cited_by_count":32,"area":null},{"id":"2101.02808","title":"Average-Reward Off-Policy Policy Evaluation with Function Approximation","created":"2021-01-08","cited_by_count":31,"area":null},{"id":"2102.09468","title":"Near-optimal Local Convergence of Alternating Gradient Descent-Ascent for Minimax Optimization","created":"2021-02-18","cited_by_count":31,"area":null},{"id":"2312.10336","title":"Certified Minimax Unlearning with Generalization Rates and Deletion Capacity","created":"2023-12-16","cited_by_count":29,"area":"safety"},{"id":"2104.13844","title":"A Generalized Projected Bellman Error for Off-policy Value Estimation in Reinforcement Learning","created":"2021-04-28","cited_by_count":26,"area":null},{"id":"2103.08280","title":"Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction","created":"2021-03-15","cited_by_count":24,"area":null},{"id":"2205.05653","title":"The First Optimal Algorithm for Smooth and Strongly-Convex-Strongly-Concave Minimax Optimization","created":"2022-05-11","cited_by_count":20,"area":null},{"id":"2206.05248","title":"Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion","created":"2022-06-10","cited_by_count":20,"area":null},{"id":"2204.09228","title":"Tight Last-Iterate Convergence of the Extragradient and the Optimistic Gradient Descent-Ascent Algorithm for Constrained Monotone Variational Inequalities","created":"2022-04-20","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":"2106.05012","title":"Bayesian Bellman Operators","created":"2021-06-09","cited_by_count":16,"area":null},{"id":"2112.15199","title":"Accelerated Primal-Dual Gradient Method for Smooth and Convex-Concave Saddle-Point Problems with Bilinear Coupling","created":"2021-12-30","cited_by_count":16,"area":null},{"id":"2202.04640","title":"Sharper Rates for Separable Minimax and Finite Sum Optimization via Primal-Dual Extragradient Methods","created":"2022-02-09","cited_by_count":15,"area":null},{"id":"2209.08005","title":"Stability and Generalization for Markov Chain Stochastic Gradient Methods","created":"2022-09-16","cited_by_count":14,"area":null},{"id":"2201.07427","title":"Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization","created":"2022-01-19","cited_by_count":13,"area":null},{"id":"2108.05338","title":"Truncated Emphatic Temporal Difference Methods for Prediction and Control","created":"2021-08-11","cited_by_count":10,"area":null},{"id":"2111.02708","title":"Quasi-Newton Methods for Saddle Point Problems and Beyond","created":"2021-11-04","cited_by_count":10,"area":null},{"id":"2206.02953","title":"Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization","created":"2022-06-07","cited_by_count":10,"area":null},{"id":"2210.05995","title":"SGDA with shuffling: faster convergence for nonconvex-P{\\L} minimax optimization","created":"2022-10-12","cited_by_count":8,"area":null},{"id":"2301.02060","title":"A first-order augmented Lagrangian method for constrained minimax optimization","created":"2023-01-05","cited_by_count":8,"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":"2410.07574","title":"Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition","created":"2024-10-10","cited_by_count":8,"area":"deeprl"},{"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":"2308.01170","title":"Revisiting a Design Choice in Gradient Temporal Difference Learning","created":"2023-08-02","cited_by_count":7,"area":null},{"id":"2103.08270","title":"DIPPA: An improved Method for Bilinear Saddle Point Problems","created":"2021-03-15","cited_by_count":6,"area":null},{"id":"2106.00993","title":"On the Convergence Rate of Off-Policy Policy Optimization Methods with Density-Ratio Correction","created":"2021-06-02","cited_by_count":5,"area":null},{"id":"2307.15868","title":"Faster Stochastic Algorithms for Minimax Optimization under Polyak--{\\L}ojasiewicz Conditions","created":"2023-07-29","cited_by_count":5,"area":null},{"id":"2410.09568","title":"Second-Order Min-Max Optimization with Lazy Hessians","created":"2024-10-12","cited_by_count":5,"area":null},{"id":"2206.08573","title":"Optimal Extragradient-Based Bilinearly-Coupled Saddle-Point Optimization","created":"2022-06-17","cited_by_count":4,"area":null},{"id":"2301.13757","title":"Toward Efficient Gradient-Based Value Estimation","created":"2023-01-31","cited_by_count":4,"area":null},{"id":"2202.00509","title":"Decentralized Stochastic Variance Reduced Extragradient Method","created":"2022-02-01","cited_by_count":3,"area":null},{"id":"2202.05812","title":"Distributed saddle point problems for strongly concave-convex functions","created":"2022-02-11","cited_by_count":3,"area":null},{"id":"2309.16819","title":"Multi-Bellman operator for convergence of $Q$-learning with linear function approximation","created":"2023-09-28","cited_by_count":3,"area":null},{"id":"2603.15576","title":"Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusions","created":"2026-03-16","cited_by_count":3,"area":null},{"id":"2604.03782","title":"An Improved Last-Iterate Convergence Rate for Anchored Gradient Descent Ascent","created":"2026-04-04","cited_by_count":3,"area":null},{"id":"2202.07808","title":"Policy Learning and Evaluation with Randomized Quasi-Monte Carlo","created":"2022-02-16","cited_by_count":2,"area":null},{"id":"2204.04858","title":"Stability and Generalization of Differentially Private Minimax Problems","created":"2022-04-11","cited_by_count":2,"area":null},{"id":"2210.17550","title":"Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimization","created":"2022-10-31","cited_by_count":2,"area":null},{"id":"2302.09875","title":"Backstepping Temporal Difference Learning","created":"2023-02-20","cited_by_count":2,"area":null},{"id":"2307.15892","title":"A new Gradient TD Algorithm with only One Step-size: Convergence Rate Analysis using $L$-$\\lambda$ Smoothness","created":"2023-07-29","cited_by_count":2,"area":null},{"id":"2506.04626","title":"Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning","created":"2025-06-05","cited_by_count":2,"area":"deeprl"},{"id":"2209.04624","title":"Gradient Descent Temporal Difference-difference Learning","created":"2022-09-10","cited_by_count":1,"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":"2404.04907","title":"Convergence Analysis of Stochastic Saddle Point Mirror Descent Algorithm -- A Projected Dynamical View Point","created":"2024-04-07","cited_by_count":1,"area":"deeprl"},{"id":"2410.08497","title":"Towards Sharper Risk Bounds for Minimax Problems","created":"2024-10-11","cited_by_count":1,"area":null},{"id":"2610.03165","title":"Sample complexity of variance-reduced policy gradient: weaker assumptions and lower bounds","created":"2026-10-02","cited_by_count":1,"area":"deeprl"},{"id":"2105.03527","title":"Scalable Projection-Free Optimization","created":"2021-05-07","cited_by_count":0,"area":null},{"id":"2410.14592","title":"Contractivity and linear convergence in bilinear saddle-point problems: An operator-theoretic approach","created":"2024-10-18","cited_by_count":0,"area":null},{"id":"2512.22909","title":"A first-order method for nonconvex-strongly-concave constrained minimax optimization","created":"2025-12-28","cited_by_count":0,"area":null},{"id":"2609.20327","title":"Near-Optimal Single-Loop Predictor--Corrector Extragradient Method for Strongly Convex--Strongly Concave Minimax Optimization","created":"2026-09-17","cited_by_count":0,"area":null}],"next_cursor":null}