站内快照 · 国内可打开。外网原文可能无法访问。
- 论文公开站arXiv
Hitting-Time Bounds for Asynchronous Q-Learning
We study the last iterate of standard asynchronous Q-learning from a single trajectory of a finite Markov decision process. The trajectory follows a fixed behavior policy whose state--action chain is irreducible and may be periodic. For discount factor $γ$, write $H=(1-γ)^{-1}$,