{"total":34,"rows":[{"id":"2201.07443","title":"On the Convergence Rates of Policy Gradient Methods","created":"2022-01-19","cited_by_count":119,"area":null},{"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":"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":"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":"2106.10268","title":"MADE: Exploration via Maximizing Deviation from Explored Regions","created":"2021-06-18","cited_by_count":40,"area":null},{"id":"2110.08923","title":"A Dual Approach to Constrained Markov Decision Processes with Entropy Regularization","created":"2021-10-17","cited_by_count":34,"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":"2110.10116","title":"On the Global Optimum Convergence of Momentum-based Policy Gradient","created":"2021-10-19","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.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":"2402.00949","title":"Geometry of Polynomial Neural Networks","created":"2024-02-01","cited_by_count":21,"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":"2403.04081","title":"Directional Smoothness and Gradient Methods: Convergence and Adaptivity","created":"2024-03-06","cited_by_count":17,"area":null},{"id":"2403.15146","title":"On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyond","created":"2024-03-22","cited_by_count":14,"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":"2206.02041","title":"First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2402.17235","title":"Stochastic Gradient Succeeds for Bandits","created":"2024-02-27","cited_by_count":10,"area":null},{"id":"2110.07810","title":"Towards Statistical and Computational Complexities of Polyak Step Size Gradient Descent","created":"2021-10-15","cited_by_count":5,"area":null},{"id":"2111.00185","title":"Convergence and Optimality of Policy Gradient Methods in Weakly Smooth Settings","created":"2021-10-30","cited_by_count":5,"area":null},{"id":"2210.06705","title":"From Gradient Flow on Population Loss to Learning with Stochastic Gradient Descent","created":"2022-10-13","cited_by_count":5,"area":null},{"id":"2311.08615","title":"Non-Uniform Smoothness for Gradient Descent","created":"2023-11-15","cited_by_count":5,"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":"2503.00229","title":"Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster","created":"2025-02-28","cited_by_count":3,"area":null},{"id":"2303.12785","title":"Matryoshka Policy Gradient for Entropy-Regularized RL: Convergence and Global Optimality","created":"2023-03-22","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":"2502.11033","title":"Convergence of Policy Mirror Descent Beyond Compatible Function Approximation","created":"2025-02-16","cited_by_count":2,"area":null},{"id":"2506.12648","title":"Glocal Smoothness: Line search and adaptive step sizes can help in theory too!","created":"2025-06-14","cited_by_count":2,"area":null},{"id":"2205.07999","title":"An Exponentially Increasing Step-size for Parameter Estimation in Statistical Models","created":"2022-05-16","cited_by_count":1,"area":null},{"id":"2403.15244","title":"A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness","created":"2024-03-22","cited_by_count":1,"area":null},{"id":"2603.15001","title":"How Log-Barrier Helps Exploration in Policy Optimization","created":"2026-03-16","cited_by_count":1,"area":null},{"id":"2202.04219","title":"Improving Computational Complexity in Statistical Models with Second-Order Information","created":"2022-02-09","cited_by_count":0,"area":null},{"id":"2306.10587","title":"Acceleration in Policy Optimization","created":"2023-06-18","cited_by_count":0,"area":null},{"id":"2608.11479","title":"Convergence Guarantees of Gradient Descent for Neural Networks via Generalized Lipschitz Smoothness","created":"2026-08-11","cited_by_count":0,"area":null}],"next_cursor":null}