We lifted 2 functions out of this paper's own repositories and ran 2 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 |
|---|---|---|
| amacrutherford/sampling-for-learnability | canonical | 2 of 2 |
| Function | Status | Where it lives |
|---|---|---|
| batchify | Ran | amacrutherford/sampling-for-learnability/sfl/train/jaxnav_sfl.py code served (permissive licence) · get_code("7233fc046405e22b") |
| unbatchify | Ran | amacrutherford/sampling-for-learnability/sfl/train/jaxnav_sfl.py code served (permissive licence) · get_code("43572d7da4a25a9d") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
What data or environments to use for training to improve downstream performance is a longstanding and very topical question in reinforcement learning. In particular, Unsupervised Environment Design (UED) methods have gained recent attention as their adaptive curricula promise to enable agents to be robust to in- and out-of-distribution tasks. This work investigates how existing UED methods select training environments, focusing on task prioritisation metrics. Surprisingly, despite methods aiming to maximise regret in theory, the practical approximations do not correlate with regret but with success rate. As a result, a significant portion of an agent's experience comes from environments it has already mastered, offering little to no contribution toward enhancing its abilities. Put differently, current methods fail to predict intuitive measures of ``learnability.'' Specifically, they are unable to consistently identify those scenarios that the agent can sometimes solve, but not always. Based on our analysis, we develop a method that directly trains on scenarios with high learnability. This simple and intuitive approach outperforms existing UED methods in several binary-outcome environments, including the standard domain of Minigrid and a novel setting closely inspired by a real-world robotics problem. We further introduce a new adversarial evaluation procedure for directly measuring robustness, closely mirroring the conditional value at risk (CVaR). We open-source all our code and present visualisations of final policies here: https://github.com/amacrutherford/sampling-for-learnability.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2408.15099")
get_code_for_paper("2408.15099")
have("2408.15099")
Connect an agent — have() is free.