Frank Hutter, André Biedenkapp, Marius Lindauer, Raghu Rajan
We lifted 3 functions out of this paper's own repositories and ran 3 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| automl/TempoRL | canonical | 3 of 3 |
| Function | Status | Where it lives |
|---|---|---|
| get_decay_schedule | Ran | automl/TempoRL/run_tabular_experiments.py code served (permissive licence) · get_code("3d9735035499e5f2") |
| make_epsilon_greedy_policy | Ran | automl/TempoRL/run_tabular_experiments.py code served (permissive licence) · get_code("15360e7eab751da9") |
| td_update | Ran | automl/TempoRL/run_tabular_experiments.py code served (permissive licence) · get_code("d027f5beb301fb30") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Reinforcement learning is a powerful approach to learn behaviour through interactions with an environment. However, behaviours are usually learned in a purely reactive fashion, where an appropriate action is selected based on an observation. In this form, it is challenging to learn when it is necessary to execute new decisions. This makes learning inefficient, especially in environments that need various degrees of fine and coarse control. To address this, we propose a proactive setting in which the agent not only selects an action in a state but also for how long to commit to that action. Our TempoRL approach introduces skip connections between states and learns a skip-policy for repeating the same action along these skips. We demonstrate the effectiveness of TempoRL on a variety of traditional and deep RL environments, showing that our approach is capable of learning successful policies up to an order of magnitude faster than vanilla Q-learning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.05262")
get_code_for_paper("2106.05262")
have("2106.05262")
Connect an agent — have() is free.