Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2111.07395
Cited By
Explicit Explore, Exploit, or Escape (
E
4
E^4
E
4
): near-optimal safety-constrained reinforcement learning in polynomial time
14 November 2021
David M. Bossens
Nick Bishop
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Explicit Explore, Exploit, or Escape ($E^4$): near-optimal safety-constrained reinforcement learning in polynomial time"
1 / 1 papers shown
Title
Polynomial-Time Approximability of Constrained Reinforcement Learning
Jeremy McMahan
222
0
0
11 Feb 2025
1