analiza aiqbench
This research introduces ELEMENT, a novel reinforcement learning framework designed to solve scalability issues in reward-free exploration by combining episodic and lifelong entropy maximization. By utilizing a kNN graph-based estimator and deriving tractable upper bounds, the method effectively maintains intrinsic motivation over millions of observations without computational prohibitions or premature state forgetting. The approach demonstrates superior performance in state coverage and unsupervised pre-training compared to existing baselines, offering a robust solution for agents operating with sparse external rewards.
ELEMENT: Episodic and Lifelong Exploration via Maximum Entropy
arXiv:2412.03800v2 Announce Type: replace-cross Abstract: Reinforcement learning agents depend on reward signals whose density is rarely under the designer's control, and when such signals are absent, an agent must generate its own drive to explore. State entropy maximization offers a principled objective for this, but existing methods break down at scale in two ways: the intrinsic reward vanishes once a state has been visited, discouraging revisits to the very gateways that lead onward, and estimating entropy over millions of accumulated observations becomes computationally prohibitive. We address both with Episodic and Lifelong Exploration via Maximum Entropy (ELEMENT), a multiscale intrinsically motivated framework for reward-free exploration that transfers to downstream tasks. ELEMENT couples lifelong entropy maximization with a complementary episodic term acting on a faster timescale. For the episodic term, we derive average episodic state entropy, an intrinsic reward that is the exact minimizer of a tractable upper bound on the reward-decomposition objective; for the lifelong term, we propose a $k$NN graph-based estimator that keeps entropy tractable without forgetting. ELEMENT consistently outperforms state-of-the-art intrinsic reward baselines on state coverage and unsupervised pre-training. Videos, code, and supplementary material: https://sites.google.com/view/element-rl.
Abstract:Reinforcement learning agents depend on reward signals whose density is rarely under the designer's control, and when such signals are absent, an agent must generate its own drive to explore. State entropy maximization offers a principled objective for this, but existing methods break down at scale in two ways: the intrinsic reward vanishes once a state has been visited, discouraging revisits to the very gateways that lead onward, and estimating entropy over millions of accumulated observations becomes computationally prohibitive. We address both with Episodic and Lifelong Exploration via Maximum Entropy (ELEMENT), a multiscale intrinsically motivated framework for reward-free exploration that transfers to downstream tasks. ELEMENT couples lifelong entropy maximization with a complementary episodic term acting on a faster timescale. For the episodic term, we derive average episodic state entropy, an intrinsic reward that is the exact minimizer of a tractable upper bound on the reward-decomposition objective; for the lifelong term, we propose a $k$NN graph-based estimator that keeps entropy tractable without forgetting. ELEMENT consistently outperforms state-of-the-art intrinsic reward baselines on state coverage and unsupervised pre-training. Videos, code, and supplementary material: this https URL.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
arXiv:2412.03800 [cs.LG]
(or arXiv:2412.03800v2 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2412.03800 Focus to learn more arXiv-issued DOI via DataCite
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 · 278 cuvinte
Subiecte conexe

Exploding variance of means of exponentials: least-squares to the rescue – Machine Learning Research Blog
francisbach.com · 27 sept. 2026

Deconfusing Corrigibility
AI Alignment Forum · 17 oct. 2026

10 Best TV Shows For Fans Of Christopher Nolan Movies
tvline.com · 24 iul. 2026

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
Quantum Journal · 13 oct. 2026