Research map / Optimization / Nonconvex and smooth optimization
An Improved Analysis of (Variance-Reduced) Policy Gradient and Natural Policy Gradient Methods
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Stochastic Policy Gradient Methods: Improved Sample Complexity for Fisher-non-degenerate Policies (ICML 2023 · similarity 0.92)
- Linear Convergence of Natural Policy Gradient Methods with Log-Linear Policies (ICLR 2023 · similarity 0.90)
- On the Convergence and Sample Efficiency of Variance-Reduced Policy Gradient Method (NeurIPS 2021 · similarity 0.89)
- Natural Policy Gradient Primal-Dual Method for Constrained Markov Decision Processes (NeurIPS 2020 · similarity 0.89)
- Natural Policy Gradient as Doubly Smoothed Policy Iteration: A Bellman-Operator Framework (NeurIPS 2026 · similarity 0.88)
- Convergence Analysis of Policy Gradient Methods with Dynamic Stochasticity (ICML 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.