mlsanityData to 13 Oct 2026

Scalar-Stepsize Nonuniform Monte Carlo Optimistic Policy Iteration: A Certified Counterexample

arXiv 2606.15978 ↗First posted 14 Jun 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Tsitsiklis proved convergence of Monte Carlo optimistic policy iteration under a uniform update structure and identified nonuniform update frequencies as a delicate obstruction. We give a certified negative answer for the natural scalar-stepsize, unnormalized asynchronous state-value recursion with fixed nonuniform state-selection probabilities. In a three-state, two-action discounted MDP, the nonuniform update frequencies induce a diagonally scaled greedy-policy mean field with a certified nonconstant attracting hybrid periodic orbit. With a bounded unbiased geometric-horizon estimator and Robbins--Monro stepsizes, the original stochastic recursion remains trapped near the cycle with positive probability and therefore fails to converge. The example pinpoints a geometric obstruction: uniform sampling gives radial residual contraction, whereas scalar nonuniform sampling anisotropically distorts the residual dynamics and can generate switched attracting cycles.

Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 5 of its 18 references that are in the map. First posted on arXiv 14 Jun 2026.

Builds on

5 of 18 references.

References · 5

  1. 2020On the Convergence of the Monte Carlo Exploring Starts Algorithm for Reinforcement Learningcited by 10
  2. 2018On the convergence of optimistic policy iteration for stochastic shortest path problemcited by 9
  3. 2020On the Convergence of Reinforcement Learning with Monte Carlo Exploring Startscited by 9
  4. 2021Optimistic Policy Iteration for MDPs with Acyclic Transient State Structurecited by 5
  5. 2026Convergence of Monte Carlo Optimistic Policy Iteration: Beyond Uniform State-Action Updatescited by 2

Built on by

Not cited yet.