Research map / Optimization / Nonconvex and smooth optimization
Optimal Convergence Rate for Exact Policy Mirror Descent in Discounted Markov Decision Processes
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
- Policy Mirror Descent with Lookahead (NeurIPS 2024 · similarity 0.94)
- Sharp Convergence and Sample Complexity of Policy Mirror Descent for Average-Reward MDPs (NeurIPS 2026 · similarity 0.93)
- Learning mirror maps in policy mirror descent (ICLR 2025 · similarity 0.90)
- Convergence of Policy Mirror Descent Beyond Compatible Function Approximation (ICML 2025 · similarity 0.90)
- Operator World Models for Reinforcement Learning (NeurIPS 2024 · similarity 0.89)
- Mirror descent actor-critic methods for entropy regularised MDPs in general spaces: stability and convergence (NeurIPS 2026 · similarity 0.88)
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.