Principled Direction-Free Intrinsic Motivation through Model-Free Epistemic Free-Energy Estimators
On the map: Deep reinforcement learning methods → Deep RL algorithms and representations
Abstract (arXiv)
Across environments with mixed sources of uncertainty, unsupervised reinforcement learning requires intrinsic motivation that does not precommit to a particular direction of surprise. Surprise minimization is scoped by design to ``unstable'' environments. Prediction-error curiosity rewards total expected surprise, including irreducible noise. Bandit or mixture switching between surprise-minimizing and surprise-maximizing rewards reintroduces non-stationarity by construction. We propose a single intrinsic reward, stationary within each window, derived from the novelty contribution of a preference-free Expected Free Energy objective, expressed in reward-maximization form. Our claim is that parameter information gain, the expected surprise of the next state minus its irreducible part, is the appropriate intrinsic signal in both high-entropy and low-entropy components of the state space. Maximizing it seeks exactly the surprise the model can explain away. In regions of unresolved dynamics, this epistemic term drives exploration. As dynamics become resolved, the epistemic term vanishes, while an aleatoric penalty favors lower-variance transitions, all without fitting an explicit next-state predictor. A pseudocount supplies epistemic value, a probe-based penalty captures aleatoric variance, and a short-horizon gate protects informative successors. A window-based freeze of all reward-defining objects yields a stationary Bellman operator, explicit bounds on learning targets, and a conditional uniform-concentration result for the nonparametric estimators under mixing, smoothness, bandwidth, and capacity assumptions. In active-inference terms, the agent is preference-free where novelty is retained, standard likelihood ambiguity vanishes under full observability, a nonstandard transition-entropy penalty is added, and surprise minimization emerges in resolved regions of the state space.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 27 of its 42 references that are in the map. First posted on arXiv 18 Jul 2026.
Builds on
27 of 42 references.
Closest ancestors · 1
Same direction, newest first
Other references · 26
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,745
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
- 2018Exploration by Random Network Distillationcited by 993
- 2021Deep Reinforcement Learning at the Edge of the Statistical Precipicecited by 807
- 2017A Distributional Perspective on Reinforcement Learningcited by 765
- 2018Diversity is All You Need: Learning Skills without a Reward Functioncited by 752
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
- 2016Deep Exploration via Bootstrapped DQNcited by 527
- 2017Distributional Reinforcement Learning with Quantile Regressioncited by 474
- 2020Planning to Explore via Self-Supervised World Modelscited by 368
- 2019Self-Supervised Exploration via Disagreementcited by 265
14 more
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 219
- 2018Deep Reinforcement Learning and the Deadly Triadcited by 174
- 2018Learning by Playing - Solving Sparse Reward Tasks from Scratchcited by 167
- 2021URLB: Unsupervised Reinforcement Learning Benchmarkcited by 139
- 2020RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated Environmentscited by 135
- 2022Understanding and Preventing Capacity Loss in Reinforcement Learningcited by 125
- 2020Active inference on discrete state-spaces: a synthesiscited by 92
- 2017Count-Based Exploration in Feature Space for Reinforcement Learningcited by 49
- 2022An information-theoretic perspective on intrinsic motivation in reinforcement learning: a surveycited by 28
- 2021How to Stay Curious while Avoiding Noisy TVs using Aleatoric Uncertainty Estimationcited by 27
- 2018Contingency-Aware Exploration in Reinforcement Learningcited by 26
- 2023DEIR: Efficient and Robust Exploration through Discriminative-Model-Based Episodic Intrinsic Rewardscited by 7
- 2023Improving Intrinsic Exploration by Creating Stationary Objectivescited by 7
- 2025On Efficient Bayesian Exploration in Model-Based Reinforcement Learningcited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Intrinsic Rewards for Exploration without Harm from Observational Noise: A Simulation Study Based on the Free Energy Principle
- 2026Maximum-Entropy Exploration with Future State-Action Visitation Measures
- 2022A Mixture of Surprises for Unsupervised Reinforcement Learning
- 2025An Information-Geometric Approach to Artificial Curiosity
- 2024ELEMENT: Episodic and Lifelong Exploration via Maximum Entropy
- 2026Endogenous Exploration in Reinforcement Learning with Intrinsic Curiosity
- 2025Beyond Noisy-TVs: Noise-Robust Exploration Via Learning Progress Monitoring
- 2024Value of Information and Reward Specification in Active Inference and POMDPs