BUCRL is the first polynomial-time Bayesian algorithm for unknown discrete MDPs with bounded diameter that attains Õ(√(DSAT)) frequentist regret with high probability.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Near-optimal Bayesian Solution For Unknown Discrete Markov Decision Process
BUCRL is the first polynomial-time Bayesian algorithm for unknown discrete MDPs with bounded diameter that attains Õ(√(DSAT)) frequentist regret with high probability.