An adaptive robust algorithm for online MDPs with finite transition prototypes achieves sublinear regret under a Lipschitz-like structural assumption.
G.; Osband, I.; and Munos, R
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Online MDP with Transition Prototypes: A Robust Adaptive Approach
An adaptive robust algorithm for online MDPs with finite transition prototypes achieves sublinear regret under a Lipschitz-like structural assumption.