arXiv Machine Learning August 28, 2026 By Zijie Cheng, Xiang Li, Yang Peng, Zhihua Zhang

A Finite Sample Analysis for Quantile Temporal Difference Learning in Distributional Reinforcement Learning

Read the original on arXiv Machine Learning →

arXiv:2608. 27313v1 Announce Type: cross Abstract: We establish a global finite-sample guarantee for synchronous quantile temporal-difference learning (QTD) in tabular distributional reinforcement learning.

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.

reinforcement-learning

Hugging Face Trending Papers

Aug 27

A Finite Sample Analysis for Quantile Temporal Difference Learning in Distributional Reinforcement Learning

We establish a global finite-sample guarantee for synchronous quantile temporal-difference learning (QTD) in tabular distributional reinforcement learning. The proof separates two stability mechanisms.

reinforcement-learning

arXiv Machine Learning

Sep 18

A Finite-Sample Analysis of Quantile Temporal-Difference Learning

arXiv:2608. 27313v2 Announce Type: replace-cross Abstract: Quantile temporal-difference learning (QTD) is an effective method for learning return distributions through quantile approximation, yet its finite-time behavior remains poorly understood.

By Zijie Cheng, Xiang Li, Yang Peng, Zhihua Zhang

arXiv Machine Learning

Oct 12

Hitting-Time Bounds for Asynchronous Q-Learning

arXiv:2610. 13901v1 Announce Type: cross Abstract: We study the last iterate of standard asynchronous Q-learning from a single trajectory of a finite Markov decision process.

By Yang Peng

reinforcement-learning

arXiv Machine Learning

2d ago

Online Inference for Quantile Distributional Reinforcement Learning

arXiv:2608. 12973v3 Announce Type: replace-cross Abstract: In this paper, we study online statistical inference for quantile-based distributional policy evaluation, which aims to characterize the distribution of discounted cumulative rewards under a given policy.

By Zijie Cheng, Yang Peng, Zhihua Zhang

reinforcement-learning

arXiv Machine Learning

Sep 22

Optimal Sample Complexity of Stable Discounted Markov Decision Processes

arXiv:2302.07477v4 Announce Type: replace Abstract: We study the optimal sample complexity of tabular reinforcement learning for infinite-horizon discounted Markov decision processes. The unrestricte...

By Shengbo Wang, Jose Blanchet, Peter Glynn

reinforcement-learning

arXiv Statistics ML

Oct 1

Sharp Statistical Rates for Asynchronous TD Learning with Markovian Data

arXiv:2609.38880v1 Announce Type: new Abstract: We study the last iterate of standard tabular temporal-difference (TD) learning from a single trajectory of a finite Markov reward process. For discoun...

By Yang Peng

One email a morning, machine-written

Related stories

A Finite Sample Analysis for Quantile Temporal Difference Learning in Distributional Reinforcement Learning

A Finite-Sample Analysis of Quantile Temporal-Difference Learning

Hitting-Time Bounds for Asynchronous Q-Learning

Online Inference for Quantile Distributional Reinforcement Learning

Optimal Sample Complexity of Stable Discounted Markov Decision Processes

Sharp Statistical Rates for Asynchronous TD Learning with Markovian Data