mlsanityData to 7 Oct 2026

Surprise-Adaptive Intrinsic Motivation for Unsupervised Reinforcement Learning

arXiv 2405.17243 ↗First posted 27 May 2024cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Both entropy-minimizing and entropy-maximizing (curiosity) objectives for unsupervised reinforcement learning (RL) have been shown to be effective in different environments, depending on the environment's level of natural entropy. However, neither method alone results in an agent that will consistently learn intelligent behavior across environments. In an effort to find a single entropy-based method that will encourage emergent behaviors in any environment, we propose an agent that can adapt its objective online, depending on the entropy conditions by framing the choice as a multi-armed bandit problem. We devise a novel intrinsic feedback signal for the bandit, which captures the agent's ability to control the entropy in its environment. We demonstrate that such agents can learn to control entropy and exhibit emergent behaviors in both high- and low-entropy regimes and can learn skillful behaviors in benchmark tasks. Videos of the trained agents and summarized findings can be found on our project page https://sites.google.com/view/surprise-adaptive-agents

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 20 of its 36 references that are in the map. First posted on arXiv 27 May 2024.

Builds on

20 of 36 references.

References · 20

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  3. 2018Exploration by Random Network Distillationcited by 966
  4. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  5. 2016Reinforcement Learning with Unsupervised Auxiliary Taskscited by 400
  6. 2020Agent57: Outperforming the Atari Human Benchmarkcited by 300
  7. 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
  8. 2018Provably Efficient Maximum Entropy Explorationcited by 240
  9. 2018Count-Based Exploration with the Successor Representationcited by 112
  10. 2021Tactical Optimism and Pessimism for Deep Reinforcement Learningcited by 55
  11. 2023Fast Rates for Maximum Entropy Explorationcited by 32
  12. 2020Griddly: A platform for AI research in gamescited by 31
8 more
  1. 2023Flipping Coins to Estimate Pseudocounts for Exploration in Reinforcement Learningcited by 28
  2. 2020Active World Model Learning with Progress Curiositycited by 27
  3. 2023Maximum State Entropy Exploration using Predecessor and Successor Representationscited by 23
  4. 2021Information is Power: Intrinsic Control via Information Capturecited by 11
  5. 2022A Mixture of Surprises for Unsupervised Reinforcement Learningcited by 9
  6. 2023Improving Intrinsic Exploration by Creating Stationary Objectivescited by 7
  7. 2021Explore and Control with Adversarial Surprisecited by 6
  8. 2015Efficient Empowermentcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.