mlsanityData to 7 Oct 2026

Online Regret Bounds for Undiscounted Continuous Reinforcement Learning

arXiv 1302.2550 ↗First posted 11 Feb 2013cs.LGcited by 17

Not on the map. Why?

Abstract (arXiv)

We derive sublinear regret bounds for undiscounted reinforcement learning in continuous state space. The proposed algorithm combines state aggregation with the use of upper confidence bounds for implementing optimism in the face of uncertainty. Beside the existence of an optimal policy which satisfies the Poisson equation, the only assumptions made are Holder continuity of rewards and transition probabilities.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Feb 2013.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 3; 2023: 2; 2024: 4; 2025: 4.

17 papers.

Sort:

By area: