The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
An information-theoretic approach to curiosity-driven reinforcement learning
Abstract
We provide a fresh look at the problem of exploration in reinforcement learning, drawing on ideas from information theory. First, we show that Boltzmann-style exploration, one of the main exploration methods used in reinforcement learning, is optimal from an information-theoretic point of view, in that it optimally trades expected return for the coding cost of the policy. Second, we address the problem of curiosity-driven learning. We propose that, in addition to maximizing the expected return, a learner should choose a policy that also maximizes the learner's predictive power. This makes the world both interesting and exploitable. Optimal policies then have the form of Boltzmann-style exploration with a bonus, containing a novel exploration-exploitation trade-off which emerges naturally from the proposed optimization principle. Importantly, this exploration-exploitation trade-off persists in the optimal deterministic policy, i.e., when there is no exploration due to randomness. As a result, exploration is understood as an emerging behavior that optimizes information gain, rather than being modeled as pure randomization of action choices.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“One common answer to this question stems from game-theoretic approaches of language evolution that emphasize utility maximization (Chaabouni, Strub, et al., 2021;Steels & Belpaeme, 2005;Still & Precup, 2012).”
From Towards Human-Like Emergent Communication via Utility, Informativeness, and Complexity (2025) · cites this paper as Still & Precup, 2012
Citations
Cites
Information theory and statistical mechanics
Jaynes, E. T. (1957) · Physical Review · doi:10.1103/physrev.106.620 · Cited by 12,931
The information bottleneck method
Tishby, N., Pereira, F. C., & Bialek, W. (2000) · arXiv · doi:10.48550/arxiv.physics/0004057 · Cited by 2,626 · cited 1×
“Information theoretic approaches inspired by some form of rate-distortion theory have been used widely in machine learning, for example for clustering and dimensionality reduction [26,21,6,20].”
Method
Research works printed but not linked: 32
- Ay N, Bertschinger N, Der R, Guttler F, Olbrich E (2008) Predictive information and explorative behavior of autonomous robots. Eur Phys J B 63:329–339 · DOI
- Azar MG, Kappen HJ (2010) Dynamic policy programming. J Mach Learn Res arXiv:1004.2027:1–26 · arXiv
- Bagnell JA, Schneider J (2003) Covariant policy search. In: International Joint Conference on Artificial Intelligence (IJCAI), Acapulco, Mexico
- Bialek W, Nemenman I, Tishby N (2001) Predictability, complexity and learning. Neural Comput 13:2409–2463 · DOI
- Chechnik G, Globerson A, Tishby N, Weiss Y (2005) Information bottleneck for gaussian variables. J Mach Learn Res 6:165–188
- Chigirev DV, Bialek W (2004) Optimal manifold representation of data: an information theoretic perspective. In: Thrun S, Saul L, Schölkopf B (eds) Advances in neural information processing systems 16. MIT Press, Cambridge, MA · DOI
- Crutchfield JP, Feldman DP (2001) Synchronizing to the environment: information theoretic limits on agent learning. Adv Complex Syst 4(2):251–264 · DOI
- Crutchfield JP, Feldman DP (2003) Regularities unseen, randomness observed: levels of entropy convergence. Chaos 13(1):25–54 · DOI
- Kearns M, Singh S (Eds) (1998) Near-optimal reinforcement learning in polynomial time. In: Proceedings of the 15th International Conference on Machine Learning, pp 260–268
- Little DY, Sommer FT (2011) Learning in embodied action-perception loops through exploration. arXiv:1112.1125v2 · arXiv
- Oudeyer P-Y, Kaplan F, Hafner V (2007) Intrinsic motivation systems for autonomous mental development. IEEE Trans Evol Comput 11(2):265–286 · DOI · Paper page
- Pereira F, Tishby N, Lee L (1993) Distributional clustering of english words. In 30th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, pp 183–190. http://xxx.lanl.gov/pdf/cmp-lg/9408011 · DOI · Paper page
- Peters J, Muelling K, Altun Y (2010) Relative entropy policy search. In: Proceedings of the Twenty-Fourth National Conference on Artificial Intelligence (AAAI). AAAI Press, Menlo Park · DOI
- Peters J, Schaal S (2008) Reinforcement learning of motor skills with policy gradients. Neural Netw 21(4):682–697 · DOI · Paper page
- Ratitch B, Precup D (2003) Using MDP characteristics to guide exploration in reinforcement learning. In: Proceedings of ECML, pp 313–324 · DOI
- Rose K (1998) Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proc IEEE 86(11):2210–2239 · DOI
- Rose K, Gurewitz E, Fox GC (1990) Statistical mechanics and phase transitions in clustering. Phys Rev Lett 65(8):945–948 · DOI
- Schmidhuber J (1991) Curious model-building control systems. In Proceedings of IJCNN, pp 1458–1463 · DOI
- Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27:379–423, 623–656 · DOI · Paper page
- Shaw R (1984) The dripping faucet as a model chaotic system. Aerial Press, Santa Cruz, California
- Singh S, Barto AG, Chentanez N (2005) Intrinsically motivated reinforcement learning. In Proceedings of NIPS, pp 1281–1288 · DOI
- Still S (2009) Information-theoretic approach to interactive learning. EPL 85 28005. doi: 10.1209/0295-5075/85/28005 · DOI
- Still S, Bialek W (2004) How many clusters? An information theoretic perspective. Neural Computation 16(12):2483–2506 · DOI
- Still S, Bialek W, Bottou L (2004) Geometric clustering using the information bottleneck method. In: Thrun S, Saul LK, Schölkopf B (eds) Advances in neural information processing systems 16. MIT Press, Cambridge, MA · DOI
- Strehl AL, Li L, Littman ML (2006) Incremental model-based learners with formal learning-time guarantees. In: Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, Cambridge, MA
- Sutton RS, Barto AG (1998) Reinforcement learning: an introduction. MIT Press, Cambridge · DOI · Paper page
- Taylor ME, Stone P (2009) Transfer learning for reinforcement learning domains: a survey. J Mach Learn Res 10(1):1633–1685
- Thrun S, Moeller K (1992) Active exploration in dynamic environments. In: Advances in Neural Information Processing Systems (NIPS) 4, San Mateo, CA, pp 531–538
- Tishby N, Polani D (2010) Information theory of decisions and actions. In: Perception-reason-action cycle: models, algorithms and systems. Springer, New York · DOI · Paper page
- Todorov E (2009) Efficient computation of optimal actions. Proc Nat Acad Sci USA 106(28):11478–11483 · DOI · Paper page
- Watkins CJCH (1989) Learning from delayed rewards. PhD thesis, Cambridge University
- Wingate D, Singh S (2007) On discovery and learning of models with predictive representations of state for agents with continuous actions and observations. In Proceedings of International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp 1128–1135 · DOI
Cited by
Sorted by citations
Items 101–183 of 183
Towards Information-Seeking AgentsPreprint
Bachman, P., Sordoni, A., & Trischler, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.02605 · Cited by 10
“…a vast literature on applications of information gain measures for artificial curiosity, intrinsically-motivated exploration, and other more precise goals (Storck et al., 1995; Schmidhuber, 2005; Still & Precup, 2012; Hernández-Lobato et al., 2014; Mohamed & Rezende, 2015; Houthooft et al., 2016).”
BackgroundApplications of the Free Energy Principle to Machine Learning and NeurosciencePreprint
Millidge, B. (2021) · arXiv (Cornell University) · doi:10.7488/era/1501 · Cited by 13
Sensory substitution reveals a manipulation bias
Zai, A. T., Cavé-Lopez, S., Rolland, M., Giret, N., & Hahnloser, R. H. R. (2020) · Nature Communications · doi:10.1038/s41467-020-19686-w · Cited by 24
Active Inference and Intentional BehaviourPreprint
Friston, K., Salvatori, T., Isomura, T., Tschantz, A., Kiefer, A. B., Verbelen, T., Koudahl, M. T., Paul, A., Parr, T., Razi, A., et al. (2023) · arXiv.org · doi:10.48550/arxiv.2312.07547 · Cited by 12
“This resolution of uncertainty is related to artificial curiosity [54, 55] and speaks to the value of information [56].”
BackgroundLearning-Driven Exploration for Reinforcement Learning
Usama, M., & Chang, D. E. (2021) · International Conference on Control, Automation and Systems (ICCAS) · doi:10.23919/iccas52745.2021.9649810 · Cited by 9
“[10] view the problem of exploration from an information-theoretic prospective and maximizes the information that the most recent state-action pair carries about the future.”
Exploration and preference satisfaction trade-off in reward-free learning
Sajid, N., Tigas, P., Zakharov, A., Fountas, Z., & Friston, K. (2021) · arXiv · doi:10.48550/arxiv.2106.04316 · Cited by 11
“Over the years, a variety of intrinsic motivation methods have been proposed, largely focusing on exploration, based on information gain [30, 64], prediction error [1, 45, 61], novelty search [39, 56], curiosity [50, 51], entropy [21, 38], or empowerment [36, 42].”
(Ir)rationality in AI: state of the art, research challenges and open questions
Macmillan-Scott, O., & Musolesi, M. (2025) · Artificial Intelligence Review · doi:10.1007/s10462-025-11341-4 · Cited by 12
“Therefore, random behaviour does not necessarily equate to irrational behaviour – where there is a longer-term motivation, taking random actions may in fact allow an agent to arrive at the optimal strategy (Still & Precup 2012).”
A Drive towards Thermodynamic Efficiency for Dissipative Structures in Chemical Reaction Networks
Ueltzhöffer, K., Costa, L. D., Cialfi, D., & Friston, K. (2021) · Entropy · doi:10.3390/e23091115 · Cited by 11
“From the requisite predictive dynamics, which can be linked to an information bottleneck [21], agent-like features, such as action policies that balance exploration and exploitation [22], and curiosity driven reinforcement-learning [23] can be derived (c.”
BackgroundExploration: from machines to humans
Fox, L., Dan, O., Elber‐Dorozko, L., & Loewenstein, Y. (2020) · Current Opinion in Behavioral Sciences · doi:10.1016/j.cobeha.2020.08.004 · Cited by 11
Generative adversarial exploration for reinforcement learning
Hong, W., Zhu, M., Liu, M., Zhang, W., Zhou, M. Q., Yu, Y. H., & Sun, P. (2019) · International Conference on Distributed Artificial Intelligence · doi:10.1145/3356464.3357706 · Cited by 13
“Besides these count-based methods, information theory is widely used to denote the uncertainty reduction of visiting a state, such as maximizing information gain [6], empowerment (or called mutual information) [16, 24], etc.”
MethodEmpowerment-driven Exploration using Mutual Information Estimation
Kumar, N. (2018) · arXiv.org · doi:10.48550/arxiv.1810.05533 · Cited by 11
Information Theoretically Aided Reinforcement Learning for Embodied AgentsPreprint
Montúfar, G., Ghazi-Zahedi, K., & Ay, N. (2016) · arXiv.org · doi:10.48550/arxiv.1605.09735 · Cited by 11
“Still and Precup (2012) stressed the importance of choosing policies that not only maximize a task objective, but also allow for high predictive power, which should make the world both interesting and exploitable.”
BackgroundFrom pixels to planning: scale-free active inference
Friston, K. J., Heins, C., Verbelen, T., Costa, L. D., Salvatori, T., Marković, D., Tschantz, A., Koudahl, M., Buckley, C., & Parr, T. (2025) · Frontiers in Network Physiology · doi:10.3389/fnetp.2025.1521963 · Cited by 33
On Hard Exploration for Reinforcement Learning: a Case Study in Pommerman
Gao, C., Kartal, B., Hernandez-Leal, P., & Taylor, M. E. (2019) · Artificial Intelligence and Interactive Digital Entertainment Conference · doi:10.48550/arxiv.1907.11788 · Cited by 10
“Thrun (1992) divided exploration methods in two: undirected, which are closely related to a random walk with the advantage of not using specific knowledge (Szepesvári 2010; Still and Precup 2012); and directed, which need domain specific knowledge with the advantage of generally better exploration.”
Consciousness in Humanoid Robots
Chella, A., Cangelosi, A., Metta, G., & Bringsjord, S. (2019) · Frontiers Research Topics · doi:10.3389/978-2-88945-866-0 · Cited by 10
“This means that the most probable policies or paths are those that resolve uncertainty when navigating the lived world (Berlyne, 1950; Schmidhuber, 2006; Baranes and Oudeyer, 2009; Still and Precup, 2012; Barto et al., 2013; Moulin and Souchay, 2015).”
BackgroundAction chunking as conditional policy compression
Lai, L., Huang, A. Z., & Gershman, S. J. (2022) · doi:10.31234/osf.io/z8yrv · Cited by 9
“6 leads to the optimal policy, π ∗ (Parush et al., 2011; Tishby and Polani, 2011; Still and Precup, 2012): The optimal policy is a softmax function, with an added frequency-dependent bias (persever-ation) term.”
On Rate-Distortion Theory in Capacity-Limited Cognition & Reinforcement Learning
Arumugam, D., Ho, M. K., Goodman, N. D., & Roy, B. V. (2022) · arXiv.org · doi:10.48550/arxiv.2210.16877 · Cited by 9
“…to various reinforcementlearning approaches that draw direct inspiration from this line of thinking [Klyubin et al., 2005, Ortega and Braun, 2011, Still and Precup, 2012, Ortega and Braun, 2013, Shafieepoorfard et al., 2016, Tiomkin and Tishby, 2017, Lerch and Sims, 2018, 2019, Abel et al.,…”
BackgroundExplore and Control with Adversarial SurprisePreprint
Fickinger, A., Jaques, N., Parajuli, S., Chang, M., Rhinehart, N., Berseth, G., Russell, S., & Levine, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.07394 · Cited by 9
From Curiosity to Competence: How World Models Interact with the Dynamics of ExplorationPreprint
Mantiuk, F., Zhou, H., & Wu, C. M. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2507.08210 · Cited by 3
“2b; Gottlieb et al., 2013; Nelson, 2005; Oudeyer & Kaplan, 2007; Still & Precup, 2012).”
Meta-Cognitive Memory Policy Optimization for Long-Horizon LLM Agents
Liu, Z., Hao, Z., Chen, Y., Wang, H., Hou, J., Ding, R., Yang, Y., Ji, W., Xia, W., & Liu, F. (2026) · arXiv · Cited by 12
“…decision-making under partial observability (Åström, 1965; Smallwood and Sondik, 1973; Kaelbling et al., 1998), with related work studying history compression through predictive state representations and information-theoretic sufficient statistics (Littman and Sutton, 2001; Still and Precup, 2012).”
Survival in a world of complex dangers
Mobbs, D., Wise, T., Tashjian, S. M., Zhang, J., Friston, K. J., & Headley, D. B. (2024) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2024.105924 · Cited by 13
Active sensing with predictive coding and uncertainty minimization
Sharafeldin, A., Imam, N., & Choi, H. (2024) · Patterns · doi:10.1016/j.patter.2024.100983 · Cited by 1
WILD-SCAV: Benchmarking FPS Gaming AI on Unity3D-based Environments
Chen, X., Shi, T., Zhao, Q., Sun, Y., Gao, Y.-F., & Wang, X.-J. (2022) · arXiv.org · doi:10.48550/arxiv.2210.09026 · Cited by 7
“Curiosity-driven reinforcement learning method can be utilized to encourage exploration in sparse reward setting [33, 34].”
MethodSchenke, M., & Wallscheid, O. (2021) · arXiv.org · doi:10.48550/arxiv.2105.08990 · Cited by 7
“…of visits to each state [9]. c) Directed exploration based on alternative learning models, where approaches are based, e.g., on concepts of learned system models [10], which allows trajectory planning, or built-in curiosity [11], which encourages an RL agent to explore what has not been seen.”
Intrinsic motivation in virtual assistant interaction for fostering spontaneous interactions
Li, C., & YANAGISAWA, H. (2021) · PLoS ONE · doi:10.1371/journal.pone.0250326 · Cited by 7
“Studies on the relationship between physiological arousal and hedonic states have also stated that reducing uncertainty “makes the world enjoyable” [26,27].”
BackgroundAutonomous reinforcement learning with hierarchical REPS
Daniel, C., Neumann, G., & Peters, J. (2013) · IEEE International Joint Conference on Neural Network · doi:10.1109/ijcnn.2013.6706759 · Cited by 7
“REPS is an information theoretic policy search approach which is based on the insight that the information loss between two policy steps should be bounded [19], [20], [8].”
BackgroundProximal Policy Optimization with Adaptive ExplorationPreprint
Lixandru, A. (2024) · arXiv.org · doi:10.48550/arxiv.2405.04664 · Cited by 6
“Previous methods to address the dual control problem include curiosity-driven reinforcement learning [1] and the use of the epsilon coefficient in Deep Q Networks [2].”
MethodJarrett, D., Tallec, C., Altché, F., Mesnard, T., Munos, R., & Valko, M. (2022) · International Conference on Machine Learning · doi:10.48550/arxiv.2211.10515 · Cited by 6
Dynamic allocation of limited memory resources in reinforcement learning
Patel, N., Acerbi, L., & Pouget, A. (2020) · Archive ouverte UNIGE (University of Geneva) · doi:10.48550/arxiv.2011.06387 · Cited by 2
“First, previous studies have considered capacity-limited agents that trade reward to gain information [8–11], but did so in a way that abstracts away the underlying costs, and therefore cannot disambiguate the effects of limited storage capacity from other energetic or computational limitations.”
BackgroundCuriosity-driven Reinforcement Learning for Dialogue Management
Wesselmann, P., Wu, Y.-C., & Gasic, M. (2019) · IEEE International Conference on Acoustics, Speech, and Signal Processing · doi:10.1109/icassp.2019.8683033 · Cited by 6
“Closely related measures of curiosity used as intrinsic reward signals are prediction uncertainty [11, 12] and improvement [13].”
BackgroundPandian, J. A., Thirunavukarasu, R., & Nagarajan, R. (2025) · Scientific Reports · doi:10.1038/s41598-025-23769-3 · Cited by 2
Farooq, S., Rahman, H., Wahid, S. A., Ansari, M. A., Wahid, S., & Lee, H. (2025) · De Computis · doi:10.3390/computers14100434 · Cited by 5
“Different methods have been suggested to quantify information gain during exploration by authors like Mobin et al. [52], Still and Precup [53], and Storck et al. [54].”
Life-inspired interoceptive artificial intelligence for autonomous and adaptive agents
Lee, S., Oh, Y., An, H., Yoon, H., Friston, K. J., Hong, S., & Woo, C. (2026) · Nature Machine Intelligence · doi:10.1038/s42256-026-01296-8 · Cited by 11
“The common approach in RL to address this dilemma involves using ad hoc novelty-based intrinsic rewards, encouraging agents to explore more when encountering novel situations in their environment 88–91 .”
Beyond Surprise: Improving Exploration Through Surprise Novelty
Le, H., Do, K., Nguyen, D., & Venkatesh, S. (2023) · Adaptive Agents and Multi-Agent Systems · doi:10.5555/3635637.3662964 · Cited by 5
Reward Maximisation through Discrete Active InferencePreprint
Costa, L. D., Sajid, N., Parr, T., Friston, K., & Smith, R. (2020) · arXiv.org · doi:10.48550/arxiv.2009.08111 · Cited by 4
“, 2013), 3) the expected free energy effectively addresses the explore-exploit dilemma and confers the agent with artificial curiosity (Friston et al., 2017b; Schmidhuber, 2010; Schwartenbeck et al., 2019; Still and Precup, 2012), as opposed to the need to add ad-hoc information bonus terms (Tokic and Palm, 2011), and…”
BackgroundIs Pessimism Provably Efficient for Offline Reinforcement Learning?
Jin, Y., Yang, Z., & Wang, Z. (2024) · Mathematics of Operations Research · doi:10.1287/moor.2022.0216 · Cited by 95
Satisficing Exploration for Deep Reinforcement LearningPreprint
Arumugam, D., Kumar, S., Gummadi, R., & Roy, B. V. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2407.12185 · Cited by 3
“…et al., 2004; Klyubin et al., 2005; Todorov, 2007; Klyubin et al., 2008; Still, 2009; Polani, 2009; Ortega & Braun, 2011; van Dijk & Polani, 2011; Still & Precup, 2012; Tishby & Polani, 2011; Sun et al., 2011; Rubin et al., 2012; Ortega & Braun, 2013; Mohamed & Jimenez Rezende, 2015; Houthooft…”
Self-Supervised Exploration via Temporal Inconsistency in Reinforcement Learning
Gao, Z., Xu, K., Zhai, Y., Ding, B., Feng, D., Mao, X., & Wang, H. (2024) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2024.3413692 · Cited by 3
“Many of previous exploratory attempts employ prediction error (Pathak et al. 2017), prediction uncertainty (Pathak, Gandhi, and Gupta 2019), or variants of uncertainty as self-driving motivations in the learning phase (Dean, Tul-siani, and Gupta 2020; Houthooft et al. 2016; Still and Precup 2012).”
MethodA Cooperation Graph Approach for Multiagent Sparse Reward Reinforcement Learning
Fu, Q., Qiu, T., Pu, Z., Yi, J., & Yuan, W. (2022) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn55064.2022.9891991 · Cited by 4
Automatic HMI Structure Exploration Via Curiosity-Based Reinforcement Learning
Cao, Y., Zheng, Y., Lin, S.-W., Liu, Y., Teo, Y., Toh, Y., & Adiga, V. (2021) · International Conference on Automated Software Engineering · doi:10.1109/ase51524.2021.9678703 · Cited by 4
“To express this goal in the form of a reward function, we leverage the concept of curiosity [17]–[19], which is an intrinsic reward that motivates the policy to explore unknown areas.”
BackgroundAutomated Testing of Mobile Applications Using a Robotic Arm
Frister, D., Oberweis, A., & Goranov, A. I. (2020) · 2020 International Conference on Computational Science and Computational Intelligence (CSCI) · doi:10.1109/csci51800.2020.00321 · Cited by 4
Mutual Information-based State-Control for Intrinsically Motivated Reinforcement LearningPreprint
Zhao, R., Gao, Y., Abbeel, P., Tresp, V., & Xu, W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.01963 · Cited by 3
“Still & Precup (2012) calculate the curiosity bonus based on the mutual information between the past and the future states within a time series.”
Factorized Mutual Information Maximization
Merkh, T., & Montúfar, G. (2019) · Kybernetika (Praha) · doi:10.48550/arxiv.1906.05460 · Cited by 4
“Some references to such regularizes, also known as intrinsic motivation, include [5, 27, 40, 11, 20, 9, 10].”
BackgroundLearning in neural networks based on a generalized fluctuation theorem.
Hayakawa, T., & Aoyagi, T. (2015) · Physical review. E, Statistical, nonlinear, and soft matter physics · doi:10.1103/physreve.92.052710 · Cited by 4
IAPO: Information-Aware Policy Optimization for Token-Efficient ReasoningPreprint
He, Y.-H., Zhu, Y.-C., Shi, M.-J., Zheng, W., Su, L., Wang, X.-Q., Guo, Q., & Li, J.-D. (2026) · arXiv.org · doi:10.48550/arxiv.2602.19049 · Cited by 3
“A. Supplementary Related Work (2012) shows that Boltzmann exploration naturally emerges when you minimize the information cost (mutual information) of a policy while maintaining a target reward level.”
Exploiting Policy Idling for Dexterous Manipulation
Chen, A. S., Brakel, P., Bronars, A., Xie, A., Huang, S. H., Groth, O., Bauzá, M., Wulfmeier, M., Heess, N., & Rao, D. (2025) · IEEE/RJS International Conference on Intelligent RObots and Systems · doi:10.1109/iros60139.2025.11246124 · Cited by 3
Sparse randomized policies for Markov decision processes based on Tsallis divergence regularization
Leleux, P., Lebichot, B., Guex, G., & Saerens, M. (2024) · Knowledge-Based Systems · doi:10.1016/j.knosys.2024.112105 · Cited by 3
Vaskevich, A., & Torres, E. B. (2022) · Frontiers in Neuroscience · doi:10.3389/fnins.2022.1033776 · Cited by 6
Solving Dynamic Principal-Agent Problems with a Rationally Inattentive Principal
Mu, T., Zheng, S., & Trott, A. R. (2022) · arXiv.org · doi:10.48550/arxiv.2202.01691 · Cited by 3
“MI has been extensively studied in the RL literature for curiosity-driven exploration and unsupervised skill and option discovery (Still & Precup, 2012; Campos et al., 2020; Mohamed & Rezende, 2015; Gregor et al., 2016; Eysenbach et al., 2019).”
Sajid, N., Ball, P. J., & Friston, K. J. (2019) · arXiv.org · doi:10.48550/arxiv.1909.10863 · Cited by 3
“Information theoretic approaches have also been explored in a reinforcement learning context but do not leverage the (beliefs about) latent states implied by the generative model; see (Still, 2012; Mohamed & Rezende, 2015).”
BackgroundInformational Constraints and Organisation of Behaviour
Gerrit, S. (2014) · University of Hertfordshire Research Archive (University of Hertfordshire) · doi:10.18745/th.15436 · Cited by 3
Towards Human-Like Emergent Communication via Utility, Informativeness, and Complexity
Tucker, M., Shah, J., Levy, R., & Zaslavsky, N. (2025) · Open Mind · doi:10.1162/opmi_a_00188 · Cited by 2
“One common answer to this question stems from game-theoretic approaches of language evolution that emphasize utility maximization (Chaabouni, Strub, et al., 2021; Steels & Belpaeme, 2005; Still & Precup, 2012).”
Debiased Model-based Representations for Sample-efficient Continuous Control
Lyu, J., Lin, Z.-C., Fujimoto, S., Yang, K., Chen, Y.-K., Yang, S.-Y., Lu, Z.-Q., & Ye, D.-H. (2026) · arXiv.org · doi:10.48550/arxiv.2605.11711 · Cited by 2
“Many efforts have been made to enhance sample efficiency, including improving the exploration ability of the agent (Still & Precup, 2012; Burda et al., 2018; Haarnoja et al., 2018; Ladosz et al., 2022; Yang et al., 2024; Jiang et al., 2025), scaling up compute by reusing data from the re-play…”
Temporal Difference Learning with Constrained Initial Representations
Lyu, J., Yang, J., Qiao, Z., Liu, R., Liu, Z.-Y., Ye, D., Lu, Z.-Q., & Li, X. (2026) · Information Sciences · doi:10.48550/arxiv.2602.11800 · Cited by 2
“To fulfill that, some researchers enhance the sample efficiency by improving the exploration ability of the agent (Asmuth et al., 2012; Still & Precup, 2012; Burda et al., 2018; Haarnoja et al., 2018; Ladosz et al., 2022; Yang et al., 2024; Jiang et al., 2025), reducing value estimation bias (Van…”
Merze, A., & Çelebi, F. V. (2025) · Engineering Science and Technology an International Journal · doi:10.1016/j.jestch.2025.102205
Lin, F., Wei, N., & Zhai, H. (2022) · IEEE Joint International Information Technology and Artificial Intelligence Conference (ITAIC) · doi:10.1109/itaic54216.2022.9836631 · Cited by 4
Guided self-organization through an entropy-based self-advising approach
Kalantari, S., Nazemi, E., & Masoumi, B. (2022) · Computing · doi:10.1007/s00607-022-01082-5 · Cited by 2
“The authors in [55] apply the idea of maximizing predictive power to the exploration problem in reinforcement learning.”
BackgroundEscaping Stochastic Traps with Aleatoric Mapping Agents
Mavor-Parker, A. N., Young, K. A., Barry, C., & Griffin, L. D. (2021) · arXiv.org · doi:10.48550/arxiv.2102.04399 · Cited by 1
“Others consider “interesting” (Still & Precup, 2012; Schmidhuber, 1997) to mean a high dependency between present and future states and actions (i.e. “interesting” things are predictable (Still & Precup, 2012) or controllable (Mohamed & Jimenez Rezende, 2015)).”
BackgroundMethodInfluentialA behavior-environment information loop drives sensory navigation
Chen, K. S., Leighton, M. P., Clark, D. A., & Emonet, T. (2026) · arXiv.org · doi:10.48550/arxiv.2607.26295 · Cited by 1
“On the environmental side, one can move beyond simple low-dimensional sensory landscapes and consider more complex environments in which exploration-exploitation tradeoffs become salient [18, 37, 45, 54, 55].”
Wind Estimation in Unmanned Aerial Vehicles with Causal Machine Learning
Alwalan, A., & Arana-Catania, M. (2024) · arXiv.org · doi:10.48550/arxiv.2407.01154 · Cited by 1
Qiu, C., Wang, X., Ma, T.-Z., Wen, Y., & Zhang, J.-J. (2024) · International Journal of Intelligent Systems · doi:10.1155/int/9482323 · Cited by 1
Curiously exploring affordance spaces of a pouring task
Pomarlan, M., Hedblom, M. M., & Porzel, R. (2022) · Expert Syst. J. Knowl. Eng. · doi:10.1111/exsy.13213 · Cited by 1
“The difference to traditional RL is that instead of rewards being offered from particular states of the environment, they are calculated in relation to the novelty of the learned information (Still & Precup, 2012).”
BackgroundMethodFive Properties of Specific Curiosity You Didn't Know Curious Machines Should Have
Ady, N. M., Shariff, R., Günther, J., & Pilarski, P. (2022) · arXiv.org · doi:10.48550/arxiv.2212.00187 · Cited by 1
“…1, 5), uncertainty (Pathak et al., 2017, pp. 1-2), compression progress (Graziano et al., 2011, p. 44), competence (Oddi et al., 2020, pp. 2417-2418), and information gain (Bellemare et al., 2016, p. 4; Houthooft et al., 2016, pp. 2-3; Still and Precup, 2012, p. 139; Frank et al., 2014, pp. 5-6).”
Spatial Consciousness Model of Intrinsic Reward in Partially Observable Environments
Ni, Z., Jin, Y., Liu, P., & Zhao, W. (2022) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-022-01771-5 · Cited by 1
“…quantify the knowledge of the agent of the environment to design the intrinsic reward model, provide a higher intrinsic reward to the observation with insufficient knowledge to encourage the agent to explore it, and obtain better navigation strategies after fully exploring the environment[11, 12].”
BackgroundKnowledge is reward: Learning optimal exploration by predictive reward cashingPreprint
Ambrogioni, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.08518 · Cited by 1
“…as -greedy, Thompson sampling (Osband & Van Roy, 2015; Osband et al., 2016; Azizzadenesheli et al., 2018), noisy networks (Fortunato et al., 2018), random network exploration bonuses (Burda et al., 2019) and curiosity-based approaches (Still & Precup, 2012; Frank et al., 2014; Zhelo et al., 2018).”
Improving width-based planning with compact policiesPreprint
Junyent, M., Jönsson, A., & Gómez, V. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.05898 · Cited by 1
“…under different names: reward shaping (Ng et al., 1999), optimism in the face of uncertainty (Kearns & Singh, 2002), intrinsic motivation (Chentanez et al., 2005), curiosity-driven RL (Still & Precup, 2012), prediction gain (Bellemare et al., 2016), or entropy-regularized MDPs (Neu et al., 2017).”
BackgroundOn the Appeal of ComplexityPreprint
Corgnet, B., & Hérnan-Gonzalez, R. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4533553 · Cited by 1
Understanding Goal Selection Through Human Limitations
Byers, J. B., & Niv, Y. (2026) · Topics in Cognitive Science · doi:10.1111/tops.70085
Zeng, B., Cruz-Noguez, C. A., & Li, Y. (2026) · Smart and Sustainable Built Environment · doi:10.1108/sasbe-01-2026-0017
Information-Theoretic Intrinsic Motivation for Reinforcement Learning in Combinatorial Routing
Xi, R., Ni, Y., & Wu, W.-Y. (2026) · Entropy · doi:10.3390/e28020140
The World Is Bigger! A Computationally-Embedded Perspective on the Big World Hypothesis
Lewandowski, A., Ramesh, A., Meyer, E., Schuurmans, D., & Machado, M. C. (2025) · Neural Information Processing Systems · doi:10.48550/arxiv.2512.23419
“…(Schmidhuber, 1991; Chentanez et al., 2004), such as forecasting complexity (Grass-berger, 1986), statistical complexity (Crutchfield and Young, 1989), predictive information (Bialek et al., 2001; Still and Precup, 2012), and light cone complexity (Shalizi et al., 2004; Aaronson et al., 2014).”
Leveraging Temporally Extended Behavior Sharing for Multi-task Reinforcement Learning
Lee, G., Cho, D., & Kim, H. J. (2025) · IEEE/RJS International Conference on Intelligent RObots and Systems · doi:10.1109/iros60139.2025.11246876
“To promote more informed exploration, several approaches introduce intrinsic rewards based on prediction errors or state novelty [30], [15] or use information-theoretic measures to encourage information gain [31], [32].”
Parameter Estimation using Reinforcement Learning Causal Curiosity: Limits and Challenges
Arana-Catania, M., & Guo, W. (2025) · arXiv.org · doi:10.48550/arxiv.2505.08453
Mobile Robot Autonomous Environment Exploration Method based on Internal Motivation
Guo, W., Ruan, X.-G., & Chai, J. (2020) · 2020 IEEE 4th Information Technology, Networking, Electronic and Automation Control Conference (ITNEC) · doi:10.1109/itnec48623.2020.9085071
“In 2012,Precup borrowed the idea of information theory in reinforcement learning, and proposed cross-entropy as an internal motivation, and proposed a curiosity-driven reinforcement learning model [9].”
BackgroundIntrinsic Motivation Based Hierarchical Exploration for Model and Skill Learning
Lu, L., Zhang, W.-P., Gu, X., & Chen, J. (2020) · Electronics · doi:10.3390/electronics9020312
“[34] defined a curiosity‐based, weighted‐random exploration mechanism.”
Distributed interference cancellation in multi-agent scenarios
Shamsi, M., Haghighi, A. M., & Marvasti, F. (2019) · arXiv.org · doi:10.48550/arxiv.1910.10109
Measuring Time with Minimal Clocks
Robu, A. D., Salge, C., Nehaniv, C. L., & Polani, D. (2019) · Artificial Life · doi:10.1162/artl_a_00303
“While the argument for this is too long to be made in full in the present paper, we will sketch it briefly here: an agent needs to acquire a certain amount of relevant Shannon information from the environment to carry out a given task at a given performance level [28, 25, 34, 33].”
BackgroundZhang, B.-T. (2013) · Advances in interaction studies · doi:10.1075/ais.6.07zha
“The objective function can be extended by the predictive power (Zahedi et al., 2010; Still & Precup, 2012) that measures to what extent an agent can influence the environment by its actions over time.”
Intrinsic Motivation via Surprise MemoryPreprint
Le, H., Do, K., Nguyen, D., & Venkatesh, S. (2023) · arXiv.org · doi:10.48550/arxiv.2308.04836
Adapting Behaviour via Intrinsic Reward
Linke, C. (2021) · doi:10.7939/r3-53fh-0z74
“This is trivially true for approaches designed for tabular stationary problems (Chentanez et al., 2005; Still and Precup, 2012; Little and Sommer, 2013; Meuleau and Bourgine, 1999; Barto and Simsek, 2005; Szita and Lorincz, 2008; Lopes et al., 2012; Schossau et al., 2016).”
BackgroundMethodQiu, C., Wang, X., Ma, T.-Z., Wen, Y., & Zhang, J.-J. (2021) · arXiv.org · doi:10.48550/arxiv.2110.07892
“There is another approach (Still and Precup 2012) also uses mutual information as an exploration reward.”
BackgroundUnifying Count-Based Exploration and Intrinsic Motivation
Bellemare, M. G., Srinivasan, S., Ostrovski, G., Schaul, T., Saxton, D., & Munos, R. (2016) · arXiv · doi:10.48550/arxiv.1606.01868 · Cited by 264
“themes, these novelty signals might be prediction error (Singh et al., 2004; Stadie et al., 2015), value error (Simsek and Barto, 2006), learning progress (Schmidhuber, 1991), or mutual information (Still and Precup, 2012; Mohamed and Rezende, 2015). The idea also finds roots in continual learning (Ring, 1997). In Thru…”
BackgroundMethod
Metadata
- Authors
- Still, S., & Precup, D.
- Affiliations
- University of Hawaiʻi at Mānoa (US)
- McGill University (CA)
- Corresponding author
- Still, Susanne
- ORCID
- Precup, Doina
- Venue
- Theory in Biosciences
- Published
- 2012-07-12
- Volume
- 131
- Issue
- 3
- Pages
- 139-148
- ISSN
- 1431-7613 (ISSN-L)
- 1611-7530
- OpenAlex
- W2020920737
- Cited by
- 165
- References
- 0
- Citations by year
- 2026: 4 · 2025: 9 · 2024: 17 · 2023: 10 · 2022: 14 · 2021: 23 · 2020: 25 · 2019: 21 · 2018: 10 · 2017: 7 · 2016: 7 · 2015: 4 · 2014: 6 · 2013: 3 · 2012: 3
- FWCI
- 5.03
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Theory in Biosciences (publishedVersion)
- PubMed (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Keywords
- curiosity-driven learning, exploration-exploitation balance, Boltzmann exploration, information-theoretic optimization, predictive power, information gain, expected returns, deterministic policies, reinforcement learning
- MeSH terms
- Algorithms, Animals, Exploratory Behavior, Humans, Information Theory, Learning
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review