We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
In many environments, only a relatively small subset of the complete state space is necessary in order to accomplish a given task. We develop a simple technique using emergency stops (e-stops) to exploit this phenomenon. Using e-stops significantly improves sample complexity by reducing the amount of required exploration, while retaining a performance bound that efficiently trades off the rate of convergence with a small asymptotic sub-optimality gap. We analyze the regret behavior of e-stops and present empirical results in discrete and continuous settings demonstrating that our reset mechanism can provide order-of-magnitude speedups on top of existing reinforcement learning methods.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1912.01649")
get_code_for_paper("1912.01649")
have("1912.01649")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1912.01649.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1912.01649)
Connect an agent — have() is free.