REVIEW 2 cited by
Improved Analysis of UCRL2 with Empirical Bernstein Inequality
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We consider the problem of exploration-exploitation in communicating Markov Decision Processes. We provide an analysis of UCRL2 with Empirical Bernstein inequalities (UCRL2B). For any MDP with $S$ states, $A$ actions, $\Gamma \leq S$ next states and diameter $D$, the regret of UCRL2B is bounded as $\widetilde{O}(\sqrt{D\Gamma S A T})$.
Forward citations
Cited by 2 Pith papers
-
Asymptotically optimal regret in communicating Markov decision processes
The paper claims the first asymptotically optimal regret algorithm, achieving the exact logarithmic constant K(M), for average-reward communicating Markov decision processes.
-
A Bit of Freedom Goes a Long Way: Classical and Quantum Algorithms for Reinforcement Learning under a Generative Model
Improved classical and quantum regret bounds for reinforcement learning with a generative model, including a new expected-regret measure under which quantum algorithms achieve polylogarithmic regret for infinite-horiz...
Discussion (0). Continue with ORCID to comment.