Skip to content
Sagan

Paper

Data- and Variance-dependent Regret Bounds for Online Tabular MDPs

Unreadunread

AI summary

arXiv:2602. 01903v3 Announce Type: replace-cross Abstract: This work studies online episodic tabular Markov decision processes (MDPs) with known transitions and develops best-of-both-worlds algorithms that achieve refined data-dependent regret bounds in the adversarial regime and variance-dependent regret bounds in the stochastic regime.