On the Policy Convergence of Policy Mirror Descent Methods
Not on the map. Why?
Abstract (arXiv)
We study the policy convergence of unregularized policy mirror descent (PMD) with arbitrary constant step sizes for finite discounted Markov decision processes. We focus on decomposable mirror maps of the form h(p)=suma psi(p(a)), where psi satisfies standard Legendre-type assumptions. Under these conditions, we prove that the policy sequence generated by PMD converges in the policy domain to a limiting optimal policy, even when the optimal policy set is not a singleton. This result covers a broad class of commonly used mirror maps, including the squared Euclidean mirror map underlying projected Q-ascent, the negative Shannon entropy underlying softmax natural policy gradient, Tsallis entropy, the Hellinger mapping, and the Fermi-Dirac entropy. Although policy convergence has been established previously for specific PMD instances or for regularized variants such as homotopic PMD, to the best of our knowledge, this is the first systematic and unified policy convergence theory for unregularized PMD under general decomposable mirror maps and arbitrary constant step sizes. Our analysis further reveals that the convergence behavior is governed by the differentiability of psi at 0 and 1, leading to different behaviors, including finite-time termination, asymptotic convergence, and an MDP-dependent dichotomy. When psi is twice continuously differentiable with strictly positive finite curvature, we further establish local policy convergence rates for the asymptotic convergence cases, covering the standard mirror maps mentioned above.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 13 Jul 2026.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2026Mirror descent actor-critic methods for entropy regularised MDPs in general spaces: stability and convergence
- 2024Policy Mirror Descent with Lookahead
- 2024Learning mirror maps in policy mirror descent
- 2024Entropy annealing for policy mirror descent in continuous time and space
- 2025On the Convergence of Policy Mirror Descent with Temporal Difference Evaluation
- 2025Policy Mirror Descent with Temporal Difference Learning: Sample Complexity under Online Markov Data
- 2024Policy Gradient for Robust Markov Decision Processes
- 2025StaQ: a Finite Memory Approach to Discrete Action Policy Mirror Descent