HackerPapers

arXiv:2006.03357cs.LG

Curiosity Killed or Incapacitated the Cat and the Asymptotically Optimal Agent

Michael K. Cohen, Elliot Catt, Marcus Hutter

Abstract

Reinforcement learners are agents that learn to pick actions that lead to high reward. Ideally, the value of a reinforcement learner's policy approaches optimality--where the optimal informed policy is the one which maximizes reward. Unfortunately, we show that if an agent is guaranteed to be "asymptotically optimal" in any (stochastically computable) environment, then subject to an assumption about the true environment, this agent will be either "destroyed" or "incapacitated" with probability 1. Much work in reinforcement learning uses an ergodicity assumption to avoid this problem. Often, doing theoretical research under simplifying assumptions prepares us to provide practical solutions even in the absence of those assumptions, but the ergodicity assumption in reinforcement learning may have led us entirely astray in preparing safe and effective exploration strategies for agents in dangerous environments. Rather than assuming away the problem, we present an agent, Mentee, with the modest guarantee of approaching the performance of a mentor, doing safe exploration instead of reckless exploration. Critically, Mentee's exploration probability depends on the expected information gain from exploring. In a simple non-ergodic environment with a weak mentor, we find Mentee outperforms existing asymptotically optimal agents and its mentor.

arXiv comments
13 pages, with 5 page appendix; 3 figures
Journal reference
Journal of Selected Areas in Information Theory 2 (2021)
DOI
Subjects
cs.LGMachine Learning cs.AIArtificial Intelligence

On Hacker News

Linked by 2 identifiable commenters in 2 comments across 2 threads, from May 2022 to Feb 2026. Found in 1 HN submission from Jun 2020 to Jun 2020. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments2 threads

  1. The Problem with LLMs 1 comment
    • That doesn't address what I asked. The paper I linked proves undecidability for a much larger class of problems* which includes the case you're talking about of asymptotic optimality. In any case, I am certain you are unfamiliar w/ what I linked b/c I was also unaware of it…

      measurablefuncView on HNParent context

  2. DeepMind: A Generalist Agent 1 comment
    • > Methodologically, how do we create agents that aren't just good at several tasks, but make up their own tasks It's a good question, it has been asked a few times, and there are some answers[1][2] already, with the most general being to endow the agent with intrinsic motivation…

      sinenomineView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.