Curiosity is Knowledge: Self-Consistent Learning and No-Regret Optimization with Active Inference
Not on the map. Why?
Abstract (arXiv)
Active inference (AIF) unifies exploration and exploitation by minimizing the Expected Free Energy (EFE), balancing epistemic value (information gain) and pragmatic value (task performance) through a curiosity coefficient. Yet it has been unclear when this balance yields both coherent learning and efficient decision-making: insufficient curiosity can drive myopic exploitation and prevent uncertainty resolution, while excessive curiosity can induce unnecessary exploration and regret. We establish the first theoretical guarantee for EFE-minimizing agents, showing that a single requirement--sufficient curiosity--simultaneously ensures self-consistent learning (Bayesian posterior consistency) and no-regret optimization (bounded cumulative regret). Our analysis characterizes how this mechanism depends on initial uncertainty, identifiability, and objective alignment, thereby connecting AIF to classical Bayesian experimental design and Bayesian optimization within one theoretical framework. We further translate these theories into practical design guidelines for tuning the epistemic-pragmatic trade-off in hybrid learning-optimization problems, validated through real-world experiments.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 22 references that are in the map. First posted on arXiv 5 Feb 2026.
Builds on
8 of 22 references.
References · 8
- 2017Max-value Entropy Search for Efficient Bayesian Optimizationcited by 206
- 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 204
- 2023Modern Bayesian Experimental Designcited by 125
- 2018Maximizing acquisition functions for Bayesian optimizationcited by 114
- 2022Joint Entropy Search for Maximally-Informed Bayesian Optimizationcited by 55
- 2022Preference Exploration for Efficient Bayesian Optimization with Multiple Outcomescited by 42
- 2021Bayesian Algorithm Execution: Estimating Computable Properties of Black-box Functions Using Mutual Informationcited by 33
- 2025On the Implementation of a Bayesian Optimization Framework for Interconnected Systemscited by 5
Built on by
Not cited yet.