On the Convergence of Bounded Agents
Not on the map. Why?
Abstract (arXiv)
When has an agent converged? Standard models of the reinforcement learning problem give rise to a straightforward definition of convergence: An agent converges when its behavior or performance in each environment state stops changing. However, as we shift the focus of our learning problem from the environment's state to the agent's state, the concept of an agent's convergence becomes significantly less clear. In this paper, we propose two complementary accounts of agent convergence in a framing of the reinforcement learning problem that centers around bounded agents. The first view says that a bounded agent has converged when the minimal number of states needed to describe the agent's future behavior cannot decrease. The second view says that a bounded agent has converged just when the agent's performance only changes if the agent's internal state changes. We establish basic properties of these two definitions, show that they accommodate typical views of convergence in standard settings, and prove several facts about their nature and relationship. We take these perspectives, definitions, and analysis to bring clarity to a central idea of the field.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 14 of its 58 references that are in the map. First posted on arXiv 20 Jul 2023.
Builds on
14 of 58 references.
References · 14
- 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,327
- 2017Minimax Regret Bounds for Reinforcement Learningcited by 500
- 2018Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulatorcited by 211
- 2020Reward Machines: Exploiting Reward Function Structure in Reinforcement Learningcited by 183
- 2021Provably Efficient Reinforcement Learning with Linear Function Approximation Under Adaptivity Constraintscited by 124
- 2021Reinforcement Learning, Bit by Bitcited by 59
- 2021Simple Agent, Complex Environment: Efficient Reinforcement Learning with Agent Statescited by 42
- 2022Settling the Reward Hypothesiscited by 33
- 2013The Sample-Complexity of General Reinforcement Learningcited by 18
- 2016Nonparametric General Reinforcement Learningcited by 10
- 2019A Strongly Asymptotically Optimal Agent in General Environmentscited by 9
- 2016Thompson Sampling is Asymptotically Optimal in General Environmentscited by 8
2 more
Built on by
Citing papers per year: 2024: 2; 2025: 4; 2026: 1.
7 papers.
- 2024Three Dogmas of Reinforcement Learningcited by 14
- 2025Plasticity as the Mirror of Empowermentcited by 11
- 2025Modeling Others' Minds as Codecited by 6
- 2025On the Interplay Between Sparsity and Training in Deep Reinforcement Learningcited by 3
- 2024Meta-Gradient Search Control: A Method for Improving the Efficiency of Dyna-style Planningcited by 0
- 2025Forgetting is Everywherecited by 0
- 2026Artifacts as Memory Beyond the Agent Boundarycited by 0
- 2026Artifacts as Memory Beyond the Agent Boundary9 Apr 2026
- 2025Forgetting is Everywhere6 Nov 2025
- 2025Modeling Others' Minds as Code29 Sep 2025
- 2025Plasticity as the Mirror of Empowerment15 May 2025
- 2025On the Interplay Between Sparsity and Training in Deep Reinforcement Learning28 Jan 2025
- 2024Three Dogmas of Reinforcement Learning15 Jul 2024
- 2024Meta-Gradient Search Control: A Method for Improving the Efficiency of Dyna-style Planning27 Jun 2024