Nick Bishop

most citedExplicit Explore, Exploit, or Escape (

E^{4}

): near-optimal safety-constrained reinforcement learning in polynomial time

3 citations · 3 across the 3 of their papers we have counts for

collaborators

Showing cs.LGShow all

1 paper · 1 filter

cs.LG2021★ 3 cited

Explicit Explore, Exploit, or Escape ( $E^{4}$ ): near-optimal safety-constrained reinforcement learning in polynomial time

David M. Bossens, Nicholas Bishop

In reinforcement learning (RL), an agent must explore an initially unknown environment in order to learn a desired behaviour. When RL agents are deployed in real world environments…

Explicit Explore, Exploit, or Escape (E4): near-optimal safety-constrained reinforcement learning in polynomial time

Explicit Explore, Exploit, or Escape ( $E^{4}$ ): near-optimal safety-constrained reinforcement learning in polynomial time