arXiv Machine Learning By Yang Peng

Near-Minimax-Optimal Rates for Asynchronous TD Learning with Markovian Data

Read the original on arXiv Machine Learning →

arXiv:2609. 38880v2 Announce Type: replace-cross Abstract: We study the last iterate of standard importance-weighted temporal-difference (TD) learning from a single trajectory of a finite Markov decision process.

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.