Avoiding Catastrophe in Online Learning by Asking for Help
<|reference_start|>Avoiding Catastrophe in Online Learning by Asking for Help: Most learning algorithms with formal regret guarantees assume that no mistake is irreparable and essentially rely on trying all possible behaviors. This approach is problematic when some mistakes are \emph{catastrophic}, i.e., irreparable. We propose an online learning problem where the goal is to minimize the chance of catastrophe. Specifically, we assume that the payoff in each round represents the chance of avoiding catastrophe that round and aim to maximize the product of payoffs (the overall chance of avoiding catastrophe) while allowing a limited number of queries to a mentor. We first show that in general, any algorithm either constantly queries the mentor or is nearly guaranteed to cause catastrophe. However, in settings where the mentor policy class is learnable in the standard online learning model, we provide an algorithm whose regret and rate of querying the mentor both approach 0 as the time horizon grows. Conceptually, if a policy class is learnable in the absence of catastrophic risk, it is learnable in the presence of catastrophic risk if the agent can ask for help.<|reference_end|>
@article{plaut2024avoiding,
    title={Avoiding Catastrophe in Online Learning by Asking for Help},
    author={Benjamin Plaut, Hanlin Zhu, Stuart Russell},
    journal={arXiv preprint arXiv:2402.08062},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.08062},
    primaryClass={cs.LG cs.AI}
}