arXiv Machine Learning August 21, 2026 By Yuanlong Chen

On the convergence of optimistic policy iteration for stochastic shortest path problem

Read the original on arXiv Machine Learning →

arXiv:1808. 08763v3 Announce Type: replace Abstract: In this paper, we prove some convergence results of a special case of optimistic policy iteration algorithm for stochastic shortest path problem.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI

Jun 10

Convergence of Monte Carlo Optimistic Policy Iteration: Beyond Uniform State-Action Updates

arXiv:2606. 10580v1 Announce Type: cross Abstract: The asymptotic behaviour of Monte Carlo optimistic policy iteration (MC-O-PI) is a long-standing open question.

By Octave Oliviers, Glenn Vinnicombe

arXiv AI

Sep 10

Power Mean Estimation in Stochastic Continuous Monte Carlo Tree Search

arXiv:2609.06489v1 Announce Type: cross Abstract: Monte Carlo Tree Search (MCTS) has demonstrated success in online planning for deterministic environments, yet significant challenges remain in adapt...

By Tuan Dam

reinforcement-learning

arXiv Machine Learning

Jun 16

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

arXiv:2606. 15978v1 Announce Type: new Abstract: Tsitsiklis proved convergence of Monte Carlo optimistic policy iteration under a uniform update structure and identified nonuniform update frequencies as a delicate obstruction.

By Yuanlong Chen

arXiv Machine Learning

Aug 3

Convergence and Regret of the Policy Gradient for Multi-Armed Bandits in Diffusion Environment

arXiv:2607. 29593v1 Announce Type: new Abstract: This paper studies the policy gradient update for a multi-arm bandit problem in diffusion environment that is described by a stochastic differential equation (SDE) under the continuous-time reinforcement learning framework by Wang et al.

By Yanwei Jia, Du Ouyang

diffusion reinforcement-learning

arXiv Statistics ML

2d ago

Block Optimism for Nonstationary Bandits with Latent Linear Dynamics

arXiv:2610.00911v1 Announce Type: new Abstract: We study an endogenous nonstationary stochastic bandit problem with latent linear dynamics, where actions affect both immediate rewards and the future...

By Taehyun Hwang, Hyunjun Choi, Heesang Ann, Min-hwan Oh

reinforcement-learning benchmarks

arXiv Machine Learning

Aug 5

Accelerated and Stable Convergence with Anchored Generalized Optimistic Method

arXiv:2606. 21528v2 Announce Type: replace-cross Abstract: We study first-order methods for solving monotone variational inequalities arising in min-max optimization.

By Motahareh Sohrabi, Jianxin You, Simon Lacoste-Julien, Eduard Gorbunov, Gauthier Gidel

One email a morning, machine-written

Related stories

Convergence of Monte Carlo Optimistic Policy Iteration: Beyond Uniform State-Action Updates

Power Mean Estimation in Stochastic Continuous Monte Carlo Tree Search

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

Convergence and Regret of the Policy Gradient for Multi-Armed Bandits in Diffusion Environment

Block Optimism for Nonstationary Bandits with Latent Linear Dynamics

Accelerated and Stable Convergence with Anchored Generalized Optimistic Method