No Regrets: Investigating and Improving Regret Approximations for Curriculum Discovery
<|reference_start|>No Regrets: Investigating and Improving Regret Approximations for Curriculum Discovery: 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 enable agents to be robust to in- and out-of-distribution tasks. We ask to what extent these methods are themselves robust when applied to a novel setting, closely inspired by a real-world robotics problem. Surprisingly, we find that the state-of-the-art UED methods either do not improve upon the na\"{i}ve baseline of Domain Randomisation (DR), or require substantial hyperparameter tuning to do so. Our analysis shows that this is due to their underlying scoring functions failing to predict intuitive measures of ``learnability'', i.e., in finding the settings that the agent sometimes solves, but not always. Based on this, we instead directly train on levels with high learnability and find that this simple and intuitive approach outperforms UED methods and DR in several binary-outcome environments, including on our domain and the standard UED domain of Minigrid. 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.<|reference_end|>
@article{rutherford2024no,
    title={No Regrets: Investigating and Improving Regret Approximations for
  Curriculum Discovery},
    author={Alexander Rutherford, Michael Beukman, Timon Willi, Bruno Lacerda,
  Nick Hawes, Jakob Foerster},
    journal={arXiv preprint arXiv:2408.15099},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.15099},
    primaryClass={cs.LG cs.AI cs.RO}
}