{"total":156,"rows":[{"id":"2201.07443","title":"On the Convergence Rates of Policy Gradient Methods","created":"2022-01-19","cited_by_count":119,"area":null},{"id":"2108.08812","title":"Provable Benefits of Actor-Critic Methods for Offline Reinforcement Learning","created":"2021-08-19","cited_by_count":110,"area":"offlinerl"},{"id":"2105.11066","title":"Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence","created":"2021-05-24","cited_by_count":84,"area":null},{"id":"2502.00361","title":"Efficient Online Reinforcement Learning for Diffusion Policy","created":"2025-02-01","cited_by_count":71,"area":"diffusion"},{"id":"2102.08607","title":"On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Method","created":"2021-02-17","cited_by_count":70,"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":"2302.01734","title":"Stochastic Policy Gradient Methods: Improved Sample Complexity for Fisher-non-degenerate Policies","created":"2023-02-03","cited_by_count":58,"area":null},{"id":"2202.04129","title":"Independent Policy Gradient for Large-Scale Markov Potential Games: Sharper Rates, Function Approximation, and Game-Agnostic Convergence","created":"2022-02-08","cited_by_count":57,"area":null},{"id":"2102.11270","title":"Softmax Policy Gradient Methods Can Take Exponential Time to Converge","created":"2021-02-22","cited_by_count":48,"area":null},{"id":"2105.01424","title":"On the Linear convergence of Natural Policy Gradient Algorithm","created":"2021-05-04","cited_by_count":48,"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":"2107.08285","title":"Greedification Operators for Policy Optimization: Investigating Forward and Reverse KL Divergences","created":"2021-07-17","cited_by_count":41,"area":null},{"id":"2402.06886","title":"Principled Penalty-based Methods for Bilevel Reinforcement Learning and RLHF","created":"2024-02-10","cited_by_count":41,"area":"alignment"},{"id":"2411.04625","title":"Sharp Analysis for KL-Regularized Contextual Bandits and RLHF","created":"2024-11-07","cited_by_count":33,"area":"alignment"},{"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":"2209.10579","title":"First-order Policy Optimization for Robust Markov Decision Process","created":"2022-09-21","cited_by_count":32,"area":null},{"id":"2201.02373","title":"Mirror Learning: A Unifying Framework of Policy Optimisation","created":"2022-01-07","cited_by_count":31,"area":null},{"id":"2301.13139","title":"A Novel Framework for Policy Mirror Descent with General Parameterization and Linear Convergence","created":"2023-01-30","cited_by_count":30,"area":null},{"id":"2306.11700","title":"Last-Iterate Convergent Policy Gradient Primal-Dual Methods for Constrained MDPs","created":"2023-06-20","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":"2210.01050","title":"Faster Last-iterate Convergence of Policy Optimization in Zero-Sum Markov Games","created":"2022-10-03","cited_by_count":26,"area":null},{"id":"2212.14449","title":"Policy Mirror Ascent for Efficient and Independent Learning in Mean Field Games","created":"2022-12-29","cited_by_count":26,"area":null},{"id":"2110.10117","title":"Beyond Exact Gradients: Convergence of Stochastic Soft-Max Policy Gradient Methods with Entropy Regularization","created":"2021-10-19","cited_by_count":25,"area":null},{"id":"2301.06276","title":"The Role of Baselines in Policy Gradient Optimization","created":"2023-01-16","cited_by_count":25,"area":null},{"id":"2310.11677","title":"Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processes","created":"2023-10-18","cited_by_count":25,"area":null},{"id":"2111.00552","title":"Policy Optimization for Constrained MDPs with Provable Fast Global Convergence","created":"2021-10-31","cited_by_count":23,"area":null},{"id":"2211.16715","title":"Policy Optimization over General State and Action Spaces","created":"2022-11-30","cited_by_count":23,"area":null},{"id":"2310.02951","title":"A Fisher-Rao gradient flow for entropy-regularised Markov decision processes in Polish spaces","created":"2023-10-04","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":"2507.23675","title":"One-Step Flow Policy Mirror Descent","created":"2025-07-31","cited_by_count":21,"area":"diffusion"},{"id":"2206.00833","title":"Finite-Time Analysis of Entropy-Regularized Neural Natural Actor-Critic Algorithm","created":"2022-06-02","cited_by_count":20,"area":null},{"id":"2110.10351","title":"Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process","created":"2021-10-20","cited_by_count":19,"area":null},{"id":"2110.15572","title":"Understanding the Effect of Stochasticity in Policy Optimization","created":"2021-10-29","cited_by_count":18,"area":null},{"id":"2205.13746","title":"Regularized Gradient Descent Ascent for Two-Player Zero-Sum Markov Games","created":"2022-05-27","cited_by_count":18,"area":null},{"id":"2302.11381","title":"Optimal Convergence Rate for Exact Policy Mirror Descent in Discounted Markov Decision Processes","created":"2023-02-22","cited_by_count":18,"area":null},{"id":"2306.01854","title":"Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space","created":"2023-06-02","cited_by_count":18,"area":null},{"id":"2106.12112","title":"Bregman Gradient Policy Optimization","created":"2021-06-23","cited_by_count":17,"area":null},{"id":"2209.15382","title":"Linear Convergence for Natural Policy Gradient with Log-linear Policy Parametrization","created":"2022-09-30","cited_by_count":17,"area":null},{"id":"2301.13087","title":"Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation","created":"2023-01-30","cited_by_count":17,"area":null},{"id":"2106.04096","title":"Linear Convergence of Entropy-Regularized Natural Policy Gradient with Linear Function Approximation","created":"2021-06-08","cited_by_count":16,"area":null},{"id":"2305.19004","title":"Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets","created":"2023-05-30","cited_by_count":16,"area":null},{"id":"2206.05357","title":"Anchor-Changing Regularized Natural Policy Gradient for Multi-Objective Reinforcement Learning","created":"2022-06-10","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":"2201.09457","title":"Homotopic Policy Mirror Descent: Policy Convergence, Implicit Regularization, and Improved Sample Complexity","created":"2022-01-24","cited_by_count":14,"area":null},{"id":"2308.14642","title":"Rate-Optimal Policy Optimization for Linear Markov Decision Processes","created":"2023-08-28","cited_by_count":14,"area":null},{"id":"2202.09753","title":"Finite-Time Analysis of Natural Actor-Critic for POMDPs","created":"2022-02-20","cited_by_count":13,"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":"2303.04386","title":"Policy Mirror Descent Inherently Explores Action Space","created":"2023-03-08","cited_by_count":13,"area":null},{"id":"2106.08414","title":"On the Sample Complexity and Metastability of Heavy-tailed Policy Search in Continuous Control","created":"2021-06-15","cited_by_count":12,"area":null},{"id":"2211.02105","title":"Geometry and convergence of natural policy gradient methods","created":"2022-11-03","cited_by_count":12,"area":null},{"id":"2405.20250","title":"Entropy annealing for policy mirror descent in continuous time and space","created":"2024-05-30","cited_by_count":12,"area":null},{"id":"2201.05756","title":"Block Policy Mirror Descent","created":"2022-01-15","cited_by_count":11,"area":null},{"id":"2201.12332","title":"On the Hidden Biases of Policy Mirror Ascent in Continuous Action Spaces","created":"2022-01-28","cited_by_count":11,"area":null},{"id":"2402.17722","title":"Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence","created":"2024-02-27","cited_by_count":11,"area":null},{"id":"2405.10624","title":"Sample-Efficient Constrained Reinforcement Learning with General Parameterization","created":"2024-05-17","cited_by_count":11,"area":"deeprl"},{"id":"2204.05466","title":"Independent Natural Policy Gradient Methods for Potential Games: Finite-time Global Convergence with Entropy Regularization","created":"2022-04-12","cited_by_count":10,"area":null},{"id":"2209.10187","title":"On the convex formulations of robust Markov decision processes","created":"2022-09-21","cited_by_count":10,"area":null},{"id":"2405.19697","title":"Bilevel reinforcement learning via the development of hyper-gradient without lower-level convexity","created":"2024-05-30","cited_by_count":10,"area":"deeprl"},{"id":"2303.04865","title":"Convergence Rates for Localized Actor-Critic in Networked Markov Potential Games","created":"2023-03-08","cited_by_count":9,"area":null},{"id":"2210.12812","title":"Symmetric (Optimistic) Natural Policy Gradient for Multi-agent Learning with Parameter Convergence","created":"2022-10-23","cited_by_count":8,"area":null},{"id":"2305.14608","title":"Inverse Reinforcement Learning with the Average Reward Criterion","created":"2023-05-24","cited_by_count":8,"area":"offlinerl"},{"id":"2509.22963","title":"Reinforcement Learning with Discrete Diffusion Policies for Combinatorial Action Spaces","created":"2025-09-26","cited_by_count":7,"area":"diffusion"},{"id":"2210.11201","title":"Robust Imitation via Mirror Descent Inverse Reinforcement Learning","created":"2022-10-20","cited_by_count":6,"area":"offlinerl"},{"id":"2306.14133","title":"Provably Convergent Policy Optimization via Metric-aware Trust Region Methods","created":"2023-06-25","cited_by_count":6,"area":null},{"id":"2401.01084","title":"Global Convergence of Natural Policy Gradient with Hessian-aided Momentum Variance Reduction","created":"2024-01-02","cited_by_count":6,"area":"deeprl"},{"id":"2402.06783","title":"Learn to Teach: Sample-Efficient Privileged Learning for Humanoid Locomotion over Diverse Terrains","created":"2024-02-09","cited_by_count":6,"area":null},{"id":"2403.14156","title":"Policy Mirror Descent with Lookahead","created":"2024-03-21","cited_by_count":6,"area":"deeprl"},{"id":"2406.01793","title":"Towards the Transferability of Rewards Recovered via Regularized Inverse Reinforcement Learning","created":"2024-06-03","cited_by_count":6,"area":"offlinerl"},{"id":"2408.08075","title":"Independent Policy Mirror Descent for Markov Potential Games: Scaling to Large Number of Players","created":"2024-08-15","cited_by_count":6,"area":"deeprl"},{"id":"2410.01101","title":"Exploiting Structure in Offline Multi-Agent RL: The Benefits of Low Interaction Rank","created":"2024-10-01","cited_by_count":6,"area":"offlinerl"},{"id":"2306.10486","title":"On the Global Convergence of Natural Actor-Critic with Two-layer Neural Network Parametrization","created":"2023-06-18","cited_by_count":5,"area":null},{"id":"2403.19448","title":"Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients","created":"2024-03-28","cited_by_count":5,"area":"deeprl"},{"id":"2505.19946","title":"Inverse Q-Learning Done Right: Offline Imitation Learning in $Q^\\pi$-Realizable MDPs","created":"2025-05-26","cited_by_count":5,"area":"offlinerl"},{"id":"2602.05531","title":"Solving Stochastic Variational Inequalities without the Bounded Variance Assumption","created":"2026-02-05","cited_by_count":5,"area":null},{"id":"2206.01666","title":"Algorithm for Constrained Markov Decision Process with Linear Convergence","created":"2022-06-03","cited_by_count":4,"area":null},{"id":"2402.05071","title":"Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity","created":"2024-02-07","cited_by_count":4,"area":null},{"id":"2502.07141","title":"Small steps no more: Global convergence of stochastic gradient bandits for arbitrary learning rates","created":"2025-02-11","cited_by_count":4,"area":null},{"id":"2506.03757","title":"PPO in the Fisher-Rao geometry","created":"2025-06-04","cited_by_count":4,"area":"deeprl"},{"id":"2510.18340","title":"Why Policy Gradient Algorithms Work for Undiscounted Total-Reward MDPs","created":"2025-10-21","cited_by_count":4,"area":"deeprl"},{"id":"2603.02576","title":"Wasserstein Proximal Policy Gradient","created":"2026-03-03","cited_by_count":4,"area":"deeprl"},{"id":"2110.02398","title":"Approximate Newton policy gradient algorithms","created":"2021-10-05","cited_by_count":3,"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":"2501.04879","title":"Multilinear Tensor Low-Rank Approximation for Policy-Gradient Methods in Reinforcement Learning","created":"2025-01-08","cited_by_count":3,"area":"deeprl"},{"id":"2509.18822","title":"On the Convergence of Policy Mirror Descent with Temporal Difference Evaluation","created":"2025-09-23","cited_by_count":3,"area":"deeprl"},{"id":"2510.19163","title":"Natural Gradient VI: Guarantees for Non-Conjugate Models","created":"2025-10-22","cited_by_count":3,"area":null},{"id":"2512.06244","title":"Auto-exploration for online reinforcement learning","created":"2025-12-06","cited_by_count":3,"area":"deeprl"},{"id":"2601.22801","title":"Clipping-Free Policy Optimization for Large Language Models","created":"2026-01-30","cited_by_count":3,"area":"alignment"},{"id":"2202.10506","title":"Accelerating Primal-dual Methods for Regularized Markov Decision Processes","created":"2022-02-21","cited_by_count":2,"area":null},{"id":"2211.15880","title":"Mirror descent of Hopfield model","created":"2022-11-29","cited_by_count":2,"area":null},{"id":"2301.13006","title":"Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods","created":"2023-01-30","cited_by_count":2,"area":null},{"id":"2305.19575","title":"On the Linear Convergence of Policy Gradient under Hadamard Parameterization","created":"2023-05-31","cited_by_count":2,"area":null},{"id":"2310.05230","title":"Global Convergence of Policy Gradient Methods in Reinforcement Learning, Games and Control","created":"2023-10-08","cited_by_count":2,"area":null},{"id":"2311.07411","title":"A Large Deviations Perspective on Policy Gradient Algorithms","created":"2023-11-13","cited_by_count":2,"area":null},{"id":"2312.17248","title":"Rethinking Model-based, Policy-based, and Value-based Reinforcement Learning via the Lens of Representation Complexity","created":"2023-12-28","cited_by_count":2,"area":"lr"},{"id":"2403.16829","title":"Convergence of a model-free entropy-regularized inverse reinforcement learning algorithm","created":"2024-03-25","cited_by_count":2,"area":"offlinerl"},{"id":"2408.15173","title":"Exploiting Approximate Symmetry for Efficient Multi-Agent Reinforcement Learning","created":"2024-08-27","cited_by_count":2,"area":null},{"id":"2410.01249","title":"Dual Approximation Policy Optimization","created":"2024-10-02","cited_by_count":2,"area":null},{"id":"2411.12042","title":"Fast Convergence of Softmax Policy Mirror Ascent","created":"2024-11-18","cited_by_count":2,"area":"deeprl"},{"id":"2412.11850","title":"Causal Invariance Learning via Efficient Nonconvex Optimization","created":"2024-12-16","cited_by_count":2,"area":null},{"id":"2502.11033","title":"Convergence of Policy Mirror Descent Beyond Compatible Function Approximation","created":"2025-02-16","cited_by_count":2,"area":null}],"next_cursor":"100"}