analiza aiqbench
This research paper addresses a critical gap in reinforcement learning by proposing a formal criterion to evaluate when intrinsic rewards effectively drive optimal exploration versus suboptimal behavior. The authors demonstrate that common objectives like prediction error or empowerment can fail to acquire the most informative experiences and establish specific conditions under which these methods succeed. By introducing a new objective function that prioritizes counterfactual information acquisition, the work offers a rigorous mathematical framework for improving agent learning efficiency.
When Do Intrinsic Rewards Lead to Exploration?
arXiv:2610.02159v1 Announce Type: new Abstract: Intrinsic rewards are designed to guide exploration in reinforcement learning by assigning value to an agent's experience, for example through prediction error or learning progress. However, maximizing these rewards need not produce the most informative experience available. We propose a formal criterion for exploration that compares policies by the counterfactual information they acquire: how well their histories can substitute for experience under alternative policies. We construct a single, simple environment in which specified count-based, prediction-error, empowerment, and information-gain objectives have maximizing policies that are Pareto-suboptimal at acquiring counterfactual information. We explain these failures and establish conditions under which existing intrinsic rewards successfully encourage optimal exploration. We also construct an objective that assigns a higher value whenever exploration strictly improves under our criterion.
Title:When Do Intrinsic Rewards Lead to Exploration?
Abstract:Intrinsic rewards are designed to guide exploration in reinforcement learning by assigning value to an agent's experience, for example through prediction error or learning progress. However, maximizing these rewards need not produce the most informative experience available. We propose a formal criterion for exploration that compares policies by the counterfactual information they acquire: how well their histories can substitute for experience under alternative policies. We construct a single, simple environment in which specified count-based, prediction-error, empowerment, and information-gain objectives have maximizing policies that are Pareto-suboptimal at acquiring counterfactual information. We explain these failures and establish conditions under which existing intrinsic rewards successfully encourage optimal exploration. We also construct an objective that assigns a higher value whenever exploration strictly improves under our criterion.
45 pages, 4 figures; includes mathematical appendices. Code, data, and Lean proof sources: this https URL
Machine Learning (cs.LG)
arXiv:2610.02159 [cs.LG]
(or arXiv:2610.02159v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2610.02159 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 239 cuvinte
Subiecte conexe
Maximum-Entropy Exploration with Future State-Action Visitation Measures
arXiv · 15 oct. 2026
From wantons to moral agents
AI Alignment Forum · 12 iul. 2026
ELEMENT: Episodic and Lifelong Exploration via Maximum Entropy
arXiv · 24 sept. 2026

Why do models task game?
AI Alignment Forum · 6 aug. 2026