# Concentration bounds for SSP Q-learning for average cost MDPs

arXiv: https://arxiv.org/abs/2206.03328 · HTML: https://mlsanity.com/paper/2206.03328/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 7 references that are in the map.
- First posted on arXiv 7 Jun 2022.

## Builds on (most cited first, 1 of 1)

- [Concentration of Contractive Stochastic Approximation and Reinforcement Learning](https://mlsanity.com/paper/2106.14308/) (2021)

## Abstract (arXiv)

We derive a concentration bound for a Q-learning algorithm for average cost Markov decision processes based on an equivalent shortest path problem, and compare it numerically with the alternative scheme based on relative value iteration.