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
Curiosity-Driven Exploration by Self-Supervised Prediction
Pathak, D., Agrawal, P., Efros, A. A., & Darrell, T. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2017.70 · Cited by 1,815
“Many approaches measure information gain for exploration (Little & Sommer, 2014; Still & Precup, 2012; Storck et al., 1995).”
BackgroundActive inference: a process theory
Friston, K., FitzGerald, T., Rigoli, F., Schwartenbeck, P., & Pezzulo, G. (2017) · Neural Computation · doi:10.1162/neco_a_00912 · Cited by 1,156
“This resolution of uncertainty is closely related to satisfying artificial curiosity (Schmidhuber, 1991; Still & Precup, 2012) and speaks to the value of information (Howard, 1966).”
BackgroundFriston, K., FitzGerald, T., Rigoli, F., Schwartenbeck, P., ODoherty, J., & Pezzulo, G. (2016) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2016.06.022 · Cited by 674
Active inference and epistemic value
Friston, K., Rigoli, F., Ognibene, D., Mathys, C., Fitzgerald, T., & Pezzulo, G. (2015) · Cognitive Neuroscience · doi:10.1080/17588928.2015.1020053 · Cited by 731
“In particular, it addresses how resolving uncertainty “makes the world interesting and exploitable” (Still & Precup, 2012, p. 139).”
BackgroundExploration by Random Network Distillation
Burda, Y., Edwards, H., Storkey, A., & Klimov, O. (2018) · arXiv · doi:10.48550/arxiv.1810.12894 · Cited by 527
“This has motivated work on exploration via quantification of uncertainty (Still & Precup, 2012; Houthooft et al., 2016) or prediction improvement measures (Schmidhuber, 1991a; Oudeyer et al., 2007; Lopes et al., 2012; Achiam & Sastry, 2017).”
MethodExploration in deep reinforcement learning: A survey
Ladosz, P., Weng, L., Kim, M., & Oh, H. (2022) · Information Fusion · doi:10.1016/j.inffus.2022.03.003 · Cited by 525
“The general framework for these types of approaches was presented in [54, 55].”
BackgroundPredictive Processes and the Peculiar Case of Music
Koelsch, S., Vuust, P., & Friston, K. J. (2018) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2018.10.006 · Cited by 587
“Epistemic value: also known as intrinsic value [26,75,76] or the value of information [64,77].”
Self-Supervised Exploration via DisagreementPreprint
Pathak, D., Gandhi, D., & Gupta, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.04161 · Cited by 190
“Other techniques incentivize exploration of states and actions where prediction of a forward model is highly-uncertain (Houthooft et al., 2016; Still & Precup, 2012).”
MethodVariational Information Maximisation for Intrinsically Motivated Reinforcement LearningPreprint
Mohamed, S., & Rezende, D. J. (2015) · Neural Information Processing Systems · doi:10.48550/arxiv.1509.08731 · Cited by 460
“…problem that forms the basis of a large number of applications in machine learning, including rate distortion theory [4], information bottleneck methods [26], population coding [1], curiosity-driven exploration [24, 19], model selection [3], and intrinsically-motivated reinforcement learning [20].”
BackgroundIs Pessimism Provably Efficient for Offline RL?Preprint
Jin, Y., Yang, Z.-R., & Wang, Z.-R. (2020) · International Conference on Machine Learning · doi:10.48550/arxiv.2012.15085 · Cited by 454
“In particular, such a mutual information can be cast as the information gain (Schmidhuber, 1991; 2010; Sun et al., 2011; Still and Precup, 2012; Houthooft et al., 2016; Russo and Van Roy, 2016; 2018) for estimating w h , which is induced by observing � ( s h , a h ) in addition to D .”
BackgroundLarge-Scale Study of Curiosity-Driven Learning
Burda, Y., Edwards, H., Pathak, D., Storkey, A., Darrell, T., & Efros, A. A. (2018) · arXiv · doi:10.48550/arxiv.1808.04355 · Cited by 401
“Intrinsic Motivation: A family of approaches to intrinsic motivation reward an agent based on prediction error [2, 27, 36, 42], prediction uncertainty [11, 44], or improvement [19, 34] of a forward dynamics model of the environment that gets trained along with the agent’s policy.”
BackgroundActive Inference, Curiosity and Insight
Friston, K. J., Lin, M., Frith, C., Pezzulo, G., Hobson, J. A., & Ondobaka, S. (2017) · Neural Computation · doi:10.1162/neco_a_00999 · Cited by 372
“This resolution of uncertainty is closely related to satisfying artificial curiosity (Schmidhuber, 1991; Still & Precup, 2012) and speaks to the value of information (Howard, 1966), particularly in the context of evincing information necessary to realize rewards or payoffs (see Meder & Nelson,…”
BackgroundDeep temporal models and active inference
Friston, K. J., Rosch, R. E., Parr, T., Price, C. J., & Bowman, H. (2017) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2017.04.009 · Cited by 256
“This resolution of uncertainty is closely related to satisfying artificial curiosity (Schmidhuber, 1991; Still and Precup, 2012) and speaks to the value of information (Howard, 1966).”
The thermodynamics of prediction
Still, S., Sivak, D. A., Bell, A., & Crooks, G. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.120604 · Cited by 265
Self-citationComputational mechanisms of curiosity and goal-directed exploration
Schwartenbeck, P., Passecker, J., Hauser, T. U., FitzGerald, T. H. B., Kronbichler, M., & Friston, K. J. (2019) · eLife · doi:10.7554/elife.41703 · Cited by 278
“This resolution of uncertainty is closely related to satisfying artificial curiosity ( Schmidhuber, 1991 ; Still and Precup, 2012 ) and the ‘value of information’ ( Howard, 1966 ).”
BackgroundNear-Optimal Representation Learning for Hierarchical Reinforcement LearningPreprint
Nachum, O., Gu, S., Lee, H., & Levine, S. (2018) · International Conference on Learning Representations · doi:10.48550/arxiv.1810.01257 · Cited by 239
RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated EnvironmentsPreprint
Răileanu, R., & Rocktäschel, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.12292 · Cited by 131
“…various ways, for example by rewarding surprise (Schmidhuber, 1991b;a; 2010; 2006; Achiam & Sastry, 2017), information gain (Little & Som-mer, 2013; Still & Precup, 2012; Houthooft et al., 2016), curiosity (Pathak et al., 2017; Burda et al., 2019b), empowerment (Klyubin et al., 2005; Rezende &…”
A free energy principle for a particular physics
Friston, K. (2019) · arXiv · doi:10.48550/arxiv.1906.10184 · Cited by 222
“4), the Infomax principle (Linsker, 1990) and formulations of epistemic foraging in terms of information theory and artificial curiosity (Bialek et al., 2001; Itti and Baldi, 2009; Schmidhuber, 2010; Still and Precup, 2012; Sun et al., 2011; Tishby and Polani, 2010). In the present formulation, internal states come to…”
BackgroundInfluentialModel-Based Active ExplorationPreprint
Shyam, P., Jaśkowski, W., & Gomez, F. (2018) · International Conference on Machine Learning · doi:10.48550/arxiv.1810.12162 · Cited by 207
“Still and Precup (2012) derive a trade-off between exploration and exploitation in an attempt to maximize the predictive power of the agent.”
BackgroundActive Inference: Demystified and Compared
Sajid, N., Ball, P. J., Parr, T., & Friston, K. J. (2021) · Neural Computation · doi:10.1162/neco_a_01357 · Cited by 197
“Information-theoretic approaches have also been explored in a reinforcement learning context (Still & Precup, 2012; Mohamed & Rezende, 2015; Blau, Ott, & Ramos, 2019).”
BackgroundResource-rational decision making
Bhui, R., Lai, L., & Gershman, S. J. (2021) · Current Opinion in Behavioral Sciences · doi:10.1016/j.cobeha.2021.02.015 · Cited by 168
A survey on intrinsic motivation in reinforcement learningPreprint
Aubret, A., Matignon, L., & Hassas, S. (2019) · arXiv.org · doi:10.48550/arxiv.1908.06976 · Cited by 175
End-to-End Navigation Strategy With Deep Reinforcement Learning for Mobile Robots
Shi, H.-B., Shi, L., Xu, M., & Hwang, K.-S. (2020) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2019.2936167 · Cited by 173
“An exploration strategy that uses curiosity as an intrinsic reward effectively addresses the problem [27], [28].”
BackgroundScene Construction, Visual Foraging, and Active Inference
Mirza, M. B., Adams, R. A., Mathys, C. D., & Friston, K. J. (2016) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2016.00056 · Cited by 165
“This resolution of uncertainty is closely related to satisfying artificial curiosity (Schmidhuber, 1991; Still and Precup, 2012) and speaks to the value of information (Howard, 1966).”
BackgroundThe free energy principle made simpler but not too simple
Friston, K., Da Costa, L., Sajid, N., Heins, C., Ueltzhöffer, K., Pavliotis, G. A., & Parr, T. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.07.001 · Cited by 163
“Please see [148,150] for a treatment of things like empowerment [170], information bottleneck [171] and predictive information [172,173].”
Azar, M. G., Gómez, V., & Kappen, H. (2010) · Journal of machine learning research · doi:10.5555/2503308.2503344 · Cited by 140
Friston, K. J., Costa, L. D., Hafner, D., Hesp, C., & Parr, T. (2021) · Neural Computation · doi:10.1162/neco_a_01351 · Cited by 150
“In the current setting, we could replace information distance (Crooks, 2007; Kim, 2018) by information gain (Lindley, 1956; MacKay, 1992; Still & Precup, 2012).”
BackgroundNon-Equilibrium Relations for Bounded Rational Decision-Making in Changing Environments
Grau-Moya, J., Krüger, M., & Braun, D. A. (2017) · Entropy · doi:10.3390/e20010001 · Cited by 181
Path integrals, particular kinds, and strange things
Friston, K. J., Costa, L. D., Sakthivadivel, D. A. R., Heins, C., Pavliotis, G. A., Ramstead, M. J. D., & Parr, T. (2023) · Physics of Life Reviews · doi:10.1016/j.plrev.2023.08.016 · Cited by 145
Deep temporal models and active inference
Friston, K. J., Rosch, R., Parr, T., Price, C., & Bowman, H. (2018) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2018.04.004 · Cited by 119
“This resolution of uncertainty is closely related to satisfying artificial curiosity (Schmidhuber, 1991; Still and Precup, 2012) and speaks to the value of information (Howard, 1966).”
BackgroundPredictive maps in rats and humans for spatial navigation
de Cothi, W., Nyberg, N., Griesbauer, E.-M., Ghanamé, C., Zisch, F., Lefort, J. M., Fletcher, L., Newton, C., Renaudineau, S., Bendor, D., et al. (2022) · Current Biology · doi:10.1016/j.cub.2022.06.090 · Cited by 109
Origin of perseveration in the trade-off between reward and complexity
Gershman, S. (2020) · bioRxiv · doi:10.1101/2020.01.16.903476 · Cited by 112
“In this paper, we explore a different computational rationale for perseveration, based on the notion of policy complexity (McNamee et al., 2016; Parush et al., 2011; Still and Precup, 2012; Tishby and Polani, 2011).”
BackgroundInformation asymmetry in KL-regularized RLPreprint
Galashov, A., Jayakumar, S. M., Hasenclever, L., Tirumala, D., Schwarz, J., Desjardins, G., Czarnecki, W. M., Teh, Y. W., Pascanu, R., & Heess, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.01240 · Cited by 63
“Computationally, these ideas can be modeled using tools from information and probability theory (e.g. Tishby & Polani, 2011; Ortega & Braun, 2011; Still & Precup, 2012; Rubin et al., 2012; Ortega & Braun, 2013; Tiomkin & Tishby, 2017), for instance, via constraints on the channel capacity between…”
BackgroundMethodReinforcement Learning through Active InferencePreprint
Tschantz, A., Millidge, B., Seth, A. K., & Buckley, C. L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.12636 · Cited by 96
“Information gain additionally has a substantial history outside the RL framework, going back to (Lindley, 1956; Still & Precup, 2012; Sun et al., 2011).”
Qiao, H., Chen, J., & Huang, X. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2021.3071312 · Cited by 121
“Some research formulates intrinsic motivation as the self-prediction error of states and actions, where the generated curiosity or surprise motivates the agent to explore more efficiently even if the external rewards are very sparse [111]–[114].”
BackgroundWhence the Expected Free Energy?
Millidge, B., Tschantz, A., & Buckley, C. L. (2021) · Neural Computation · doi:10.1162/neco_a_01354 · Cited by 114
Predictive maps in rats and humans for spatial navigationPreprint
de Cothi, W., Nyberg, N., Griesbauer, E.-M., Ghanamé, C., Zisch, F., Lefort, J. M., Fletcher, L., Newton, C., Renaudineau, S., Bendor, D., et al. (2020) · bioRxiv · doi:10.1101/2020.09.26.314815 · Cited by 101
“However, methods that include curiosity 106 or uncertainty in the value function 107,108 could be used to guide more efficient exploration of a new maze configuration and consequently lead to faster learning.”
Adaptive Reward-Free ExplorationPreprint
Kaufmann, E., Ménard, P., Domingues, O. D., Jönsson, A., Leurent, E., & Valko, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.06294 · Cited by 17
“Numerous attempts were made to guide the exploration in the beginning, motivated by curiosity [26, 27], intrinsic motivation [23, 4], exploration bonuses [30, 25] mutual information [24] and many of its approximations, for instance with variational autoencoders [23].”
BackgroundLinson, A., Clark, A., Ramamoorthy, S., & Friston, K. J. (2018) · Frontiers in Robotics and AI · doi:10.3389/frobt.2018.00021 · Cited by 102
“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).”
BackgroundWorld model learning and inference
Friston, K. J., Moran, R., Nagai, Y., Taniguchi, T., Gomi, H., & Tenenbaum, J. B. (2021) · Neural Networks · doi:10.1016/j.neunet.2021.09.011 · Cited by 99
“…both pragmatic (extrinsic) and epistemic (intrinsic) imperatives for good plans that resolve the exploration–exploitation dilemma (Cohen, McClure, & Yu, 2007; Friston et al., 2015; Schmidhuber, 2006; Still & Precup, 2012; Sun, Gomez, & Schmidhuber, 2011; Tschantz, Baltieri, Seth, & Buckley, 2020).”
Predictive Information Accelerates Learning in RLPreprint
Lee, K.-H., Fischer, I., Liu, A., Guo, Y., Lee, H., Canny, J., & Guadarrama, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.12401 · Cited by 45
“Some of the curiosity learning approaches reward an agent based on future prediction error or uncertainty [5, 31, 40].”
BackgroundVIME: Variational Information Maximizing ExplorationPreprint
Houthooft, R., Chen, X., Duan, Y., Schulman, J., Turck, F. D., & Abbeel, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.09674 · Cited by 597
Tschantz, A., Baltieri, M., Seth, A. K., & Buckley, C. L. (2020) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn48605.2020.9207382 · Cited by 74
“In [63], the authors derived an information-theoretic measure to maximize the predictive power of the agent, while in [64], the authors derived an objective function to maximize the mutual information between actions and future states of the environment (i.”
BackgroundPolicy compression: An information bottleneck in action selection
Lai, L., & Gershman, S. (2021) · The psychology of learning and motivation · doi:10.1016/bs.plm.2021.02.004 · Cited by 77
“The application of rate-distortion theory to action selection has been developed theoretically by a number of different authors (Fox, Pakman, & Tishby, 2016; Grau-Moya, Leibfried, & Vrancx, 2018; Lerch & Sims, 2018; Parush, Tishby, & Bergman, 2011; Still & Precup, 2012; Tishby & Polani, 2011).”
BackgroundInfluence-Based Multi-Agent Exploration
Wang, T., Wang, J., Wu, Y., & Zhang, C. (2019) · arXiv · doi:10.48550/arxiv.1910.05512 · Cited by 69
“Mutual information is a critical statistical quantity and has been used in single-agent intrinsically motivated exploration (Rubin et al., 2012; Still & Precup, 2012; Salge et al., 2014; Mohamed & Rezende, 2015; Hyoungseok Kim, 2019) and multi-agent intention sharing and hiding (Strouse et al.,…”
Random curiosity-driven exploration in deep reinforcement learning
Li, J., Shi, X., Li, J., Zhang, X., & Wang, J.-Z. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.08.024 · Cited by 68
Information Bottleneck Approach to Predictive Inference
Still, S. (2014) · Entropy · doi:10.3390/e16020968 · Cited by 57
“Section 2 makes use of material from [15,16], Section 3 uses material from [24], and Section 4 uses material form [14,17].”
InfluentialSelf-citationSee, Hear, Explore: Curiosity via Audio-Visual AssociationPreprint
Dean, V., Tulsiani, S., & Gupta, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.03669 · Cited by 37
“Prior work on exploration has used error [9, 10, 1, 11], uncertainty [12, 13, 3], and potential improvement [14] of a prediction model as intrinsic motivation.”
State Abstraction as Compression in Apprenticeship Learning
Abel, D., Arumugam, D., Asadi, K., Jinnai, Y., Littman, M. L., & Wong, L. L. S. (2019) · AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013134 · Cited by 66
“Veness et al. (2015) study information theoretic methods for policy evaluation, while Still and Precup (2012) and Goyal et al. (2018) both leverage information theory for tackling the exploration problem.”
MethodLearning Causal State Representations of Partially Observable EnvironmentsPreprint
Zhang, A., Lipton, Z. C., Pineda, L., Azizzadenesheli, K., Anandkumar, A., Itti, L., Pineau, J., & Furlanello, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.10437 · Cited by 44
“Causal states, and the related information-theoretic notion of complexity, minimality, and sufficiency are used to derive task-agnostic policies with an intrinsic exploration-exploitation trade off in [34, 35].”
MethodInformation-Theoretic Bounded RationalityPreprint
Ortega, P. A., Braun, D. A., Dyer, J. S., Kim, K.-E., & Tishby, N. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.06789 · Cited by 58
“…systems [see e.g. Mitter and Newton, 2005, Kappen, 2005, Todorov, 2006, 2009, Theodorou et al., 2010, Theodorou, 2015, Still, 2009, Still and Precup, 2012, van den Broek et al., 2010, Friston, 2010, Peters et al., 2010, Tishby and Polani, 2011, Kappen et al., 2012, Neumann and…”
Designing ecosystems of intelligence from first principles
Friston, K. J., Ramstead, M. J. D., Kiefer, A. B., Tschantz, A., Buckley, C. L., Albarracin, M., Pitliya, R. J., Heins, C., Klein, B., Millidge, B., et al. (2024) · Collective Intelligence · doi:10.1177/26339137231222481 · Cited by 80
“…thus emerges as an existential imperative (Barto et al., 2013; Lindley, 1956; MacKay, 1992; Schmidhuber, 2006; Schwartenbeck et al., 2019; Still and Precup, 2012) — to the extent that one could say that to be intelligent is (in part) to be curious, and to balance curiosity against…”
BackgroundBehavior Priors for Efficient Reinforcement LearningPreprint
Tirumala, D., Galashov, A., Noh, H., Hasenclever, L., Pascanu, R., Schwarz, J., Desjardins, G., Czarnecki, W. M., Ahuja, A., Teh, Y. W., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.14274 · Cited by 33
“Such constraints on the channel capacity between past states and future actions have been studied in a number of works (e.g. Tishby and Polani, 2011; Ortega and Braun, 2011; Still and Precup, 2012; Rubin et al., 2012; Ortega and Braun, 2013; Tiomkin and Tishby, 2017; Goyal et al., 2019).”
BackgroundNovelty Search in Representational Space for Sample Efficient ExplorationPreprint
Tao, R. Y., François-Lavet, V., & Pineau, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.13579 · Cited by 21
“Still and Precup (2012) take an information theoretic approach to exploration, that chooses a policy which maximizes the predictive power of the agent’s own behavior and environment rewards.”
BackgroundLearning Awareness ModelsPreprint
Amos, B., Dinh, L., Cabi, S., Rothörl, T., Colmenarejo, S. G., Muldal, A., Erez, T., Tassa, Y., de Freitas, N., & Denil, M. (2018) · International Conference on Learning Representations · doi:10.48550/arxiv.1804.06318 · Cited by 49
“Some representative works include Oudeyer & Kaplan (2008; 2009); Sequeira et al. (2011); Still & Precup (2012); Bellemare et al. (2016); Martius et al. (2013); Schmidhuber (2008); Mohamed & Rezende (2015); Haber et al. (2018b;a) Some of the ideas here, in particular the notion of choosing actions…”
BackgroundLLMs are Greedy Agents: Effects of RL Fine-tuning on Decision-Making AbilitiesPreprint
Schmied, T., Bornschein, J., Grau-Moya, J., Wulfmeier, M., & Pascanu, R. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2504.16078 · Cited by 41
“The trade-off between exploration and exploitation is a long-standing challenge in the field of RL (Oudeyer et al., 2007; Schmidhuber, 1991a,b; Still and Precup, 2012).”
Exploiting Hierarchy for Learning and Transfer in KL-regularized RLPreprint
Tirumala, D., Noh, H., Galashov, A., Hasenclever, L., Ahuja, A., Wayne, G., Pascanu, R., Teh, Y. W., & Heess, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.07438 · Cited by 38
“Another closely related regularization for RL is using information bottleneck (Tishby & Polani, 2011; Still & Precup, 2012; Rubin et al., 2012; Ortega & Braun, 2013; Tiomkin & Tishby, 2017).”
BackgroundWhich Mutual-Information Representation Learning Objectives are Sufficient for Control?Preprint
Rakelly, K., Gupta, A., Florensa, C., & Levine, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.07278 · Cited by 11
“The MI objectives that we study have also been used as reward bonuses to improve exploration, without impacting the representation, in the form of empowerment [36, 35, 49, 39] and information-theoretic curiosity [62].”
MethodLearning concurrent motor skills in versatile solution spaces
Daniel, C., Neumann, G., & Peters, J. (2012) · 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems · doi:10.1109/iros.2012.6386047 · Cited by 44
“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].”
BackgroundLearning to soar: Resource-constrained exploration in reinforcement learning
Chung, J. J., Lawrance, N. R. J., & Sukkarieh, S. (2015) · Int. J. Robotics Res. · doi:10.1177/0278364914553683 · Cited by 43
Human decision making balances reward maximization and policy compression
Lai, L., & Gershman, S. J. (2024) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1012057 · Cited by 43
Exploration and Anti-Exploration with Distributional Random Network DistillationPreprint
Yang, K., Tao, J., Lyu, J., & Li, X. (2024) · International Conference on Machine Learning · doi:10.48550/arxiv.2401.09750 · Cited by 42
“Alternatively, some approaches use information gain as an intrinsic reward (Still & Precup, 2012; Houthooft et al., 2016).”
BackgroundEmergent Exploration via Novelty Management
Gordon, G., Fonio, E., & Ahissar, E. (2014) · Journal of Neuroscience · doi:10.1523/jneurosci.1872-14.2014 · Cited by 52
“Our model uses similar information-theoretic principles as those used in previous approaches (Tishby and Polani, 2011; Still and Precup, 2012), yet in a different setting that enables sequential learning of convergent exploration primitives.”
MethodA Unified Bellman Optimality Principle Combining Reward Maximization and EmpowermentPreprint
Leibfried, F., Pascual-Díaz, S., & Grau-Moya, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.12392 · Cited by 20
“Empowerment is similar to curiosity concepts of predictive information that focus on the mutual information between the current and the subsequent state [6, 47, 68, 60, 42, 53].”
BackgroundTrading off Utility, Informativeness, and Complexity in Emergent Communication
Tucker, M., Levy, R., Shah, J. A., & Zaslavsky, N. (2022) · Neural Information Processing Systems · doi:10.52202/068431-1614 · Cited by 36
Reward maximization through discrete active inference
Da Costa, L., Sajid, N., Parr, T., Friston, K., & Smith, R. (2023) · Neural Computation · doi:10.1162/neco_a_01574 · Cited by 35
“This addresses the explore-exploit dilemma and confers the agent with artificial curiosity (Friston, Lin, et al., 2017; Schmidhuber, 2010; Schwartenbeck et al., 2019; Still & Precup, 2012), as opposed to the need to add ad hoc information bonus terms (Tokic & Palm, 2011).”
BackgroundGuided self-organization: perception–action loops of embodied systems
Ay, N., Der, R., & Prokopenko, M. (2011) · Theory in biosciences · doi:10.1007/s12064-011-0140-1 · Cited by 35
“…in robotic systems (Martius and Herrmann 2011), (ii) information-theoretic studies of the sensorimotor loop (Ay et al. 2011; Capdepuy et al. 2011; Still and Precup 2011), and (iii) self-organization in information processing networks (Boedecker et al. 2011; Greshenson 2011; Lizier et al. 2011).”
BackgroundAdapting Behavior via Intrinsic Reward: A Survey and Empirical Study
Linke, C., Ady, N. M., White, M., Degris, T., & White, A. (2020) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12087 · Cited by 34
“Other measures based on Information Gain have been explored (Still and Precup, 2012; Little and Sommer, 2013; Achiam and Sastry, 2017; de Abril and Kanai, 2018; Berseth et al., 2019).”
BackgroundBibliometric Analysis of Information Theoretic Studies
Lam, W., Lam, W., Jaaman, S., & Lee, P.-F. (2022) · Entropy · doi:10.3390/e24101359 · Cited by 33
“Still and Precup [6] have studied reinforcement learning by drawing on ideas from information theory, and information theoretic approaches have been studied by past researchers in stock markets and complex systems [7–11].”
BackgroundNearly maximally predictive features and their dimensions
Marzen, S., & Crutchfield, J. P. (2017) · Physical review. E · doi:10.1103/physreve.95.051301 · Cited by 26
f-Divergence constrained policy improvement
Belousov, B., & Peters, J. (2017) · arXiv.org · doi:10.48550/arxiv.1801.00056 · Cited by 31
“Alternating between maximization of the expected return at fixed information loss and subsequent information loss minimization at constant expected return (Still and Precup, 2012) yields algorithms that allow for automatic adaptation of .”
BackgroundFederated inference and belief sharing
Friston, K. J., Parr, T., Heins, C., Constant, A., Friedman, D., Isomura, T., Fields, C., Verbelen, T., Ramstead, M., Clippinger, J., et al. (2024) · Neuroscience & Biobehavioral Reviews · doi:10.1016/j.neubiorev.2023.105500 · Cited by 30
“This resolution of uncertainty is closely related to artificial curiosity (Schmidhuber, 1991; Still and Precup, 2012) and speaks to the value of information (Howard, 1966), particularly in the context of evincing information necessary to realise preferred outcomes.”
BackgroundMachine Learning With Computer Networks: Techniques, Datasets, and Models
Afifi, H., Pochaba, S., Boltres, A., Laniewski, D., Haberer, J., Paeleke, L., Poorzare, R., Stolpmann, D., Wehner, N., Redder, A., et al. (2024) · IEEE Access · doi:10.1109/access.2024.3384460 · Cited by 36
“Such methods are known as curiosity-driven RL [57], [58].”
Gülzow, J., Paetzold, P., & Deussen, O. (2020) · doi:10.3390/app10103396 · Cited by 29
“Therefore, methods to direct the learning agent to actions which yields as much new information as possible must be considered, like reverse curriculum learning [36] or curiosity-driven learning [37].”
MethodLearn Goal-Conditioned Policy with Intrinsic Motivation for Deep Reinforcement Learning
Liu, J., Wang, D.-L., Tian, Q.-X., & Chen, Z. (2021) · AAAI Conference on Artificial Intelligence · doi:10.48550/arxiv.2104.05043 · Cited by 28
Complex behavior from intrinsic motivation to occupy future action-state path space
Ramírez‐Ruiz, J., Grytskyy, D., Mastrogiuseppe, C., Habib, Y., & Moreno‐Bote, R. (2024) · Nature Communications · doi:10.1038/s41467-024-49711-1 · Cited by 31
Entropic Regularization of Markov Decision Processes
Belousov, B., & Peters, J. (2019) · Entropy · doi:10.3390/e21070674 · Cited by 13
“Apart from computational advantages, information-theoretic approaches provide a solid framework for describing and studying aspects of intelligent behavior [37], from autonomy [38] and curiosity [39] to bounded rationality [40] and game theory [41].”
BackgroundDepeweg, S., Hernández-Lobato, J. M., Doshi-Velez, F., & Udluft, S. (2017) · arXiv.org · doi:10.48550/arxiv.1710.07283 · Cited by 27
“Within reinforcement learning, Bayesian notions of model uncertainty have a long history [Schmidhuber, 1991b,a, Dearden et al., 1999, Still and Precup, 2012, Sun et al., 2011, Maddison et al., 2017, Mihatsch and Neuneier, 2002].”
BackgroundA Wizard-of-Oz study of curiosity in human-robot interaction
Law, E., Cai, V., Liu, Q.-F., Sasy, S., Goh, J., Blidaru, A., & Kulić, D. (2017) · IEEE International Symposium on Robot and Human Interactive Communication · doi:10.1109/roman.2017.8172365 · Cited by 27
“Curiosity-driven reinforcement learning [20], [32], [33], for example, encourages agents to explore parts of the state space that yield the highest information gain, as opposed to the best reward.”
BackgroundCurious Replay for Model-based Adaptation
Kauvar, I., Doyle, C., Zhou, L., & Haber, N. (2023) · International Conference on Machine Learning · doi:10.48550/arxiv.2306.15934 · Cited by 26
“…progress as with γ -progress (Kim et al., 2020); model uncertainty as with ensemble disagreement (Pathak et al., 2019; Sekar et al., 2020); novelty of latent state representations as with RIDE (Raileanu & Rockt ¨ aschel, 2020); and information gain (Still & Precup, 2012; Houthooft et al., 2016).”
BackgroundThe Variational Bandwidth Bottleneck: Stochastic Evaluation on an Information BudgetPreprint
Goyal, A., Bengio, Y., Botvinick, M., & Levine, S. (2020) · International Conference on Learning Representations · doi:10.48550/arxiv.2004.11935 · Cited by 26
“Information theoretic measures have also been used for exploration (Still & Precup, 2012; Mohamed & Rezende, 2015; Houthooft et al., 2016; Gregor et al., 2016).”
Friston, K., Costa, L. D., Tschantz, A., Kiefer, A. B., Salvatori, T., Neacsu, V., Koudahl, M. T., Heins, C., Sajid, N., Markovic, D., et al. (2023) · Biological Psychology · doi:10.48550/arxiv.2311.10300 · Cited by 25
“This resolution of uncertainty is related to artificial curiosity (Schmidhuber, 1991; Still & Precup, 2012) and speaks to the value of information (Howard, 1966).”
BackgroundActive Inference and Cognitive Consistency
Friston, K. J. (2018) · Psychological Inquiry · doi:10.1080/1047840x.2018.1480693 · Cited by 34
“This resolution of uncertainty is closely related to satisfying artificial curiosity (Schmidhuber, 1991; Still & Precup, 2012) and speaks to the value of information (Howard, 1966).”
BackgroundIs Curiosity All You Need? On the Utility of Emergent Behaviours from Curious ExplorationPreprint
Groth, O., Wulfmeier, M., Vezzani, G., Dasagi, V., Hertweck, T., Hafner, R., Heess, N., & Riedmiller, M. A. (2021) · arXiv.org · doi:10.48550/arxiv.2109.08603 · Cited by 23
“Curiosity learning can also be seen through an information theoretic lens using an information gain objective like in Still and Precup (2012) or Houthooft et al. (2016).”
Active Inference and Intentional Behavior
Friston, K. J., Salvatori, T., Isomura, T., Tschantz, A., Kiefer, A. B., Verbelen, T., Koudahl, M., Paul, A., Parr, T., Razi, A., et al. (2025) · Neural Computation · doi:10.1162/neco_a_01738 · Cited by 36
Bayesian Reinforcement Learning With Limited Cognitive Load
Arumugam, D., Ho, M. K., Goodman, N. D., & Roy, B. V. (2024) · Open Mind · doi:10.1162/opmi_a_00132 · Cited by 17
“Thus, an important direction for future research will be to develop algorithms for finding capacity-limited decision-rules based on versions of Blahut-Arimoto designed for general output distributions ( e.g. , particle filter-based algorithms [Dauwels, 2005]).”
InfluentialSMiRL: Surprise Minimizing Reinforcement Learning in Unstable EnvironmentsPreprint
Berseth, G., Geng, D., Devin, C., Rhinehart, N., Finn, C., Jayaraman, D., & Levine, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.05510 · Cited by 41
“This central problem in artificial intelligence has evoked a number of solutions, mainly focusing on novelty-seeking behaviors (Schmidhuber, 1991; Lehman & Stanley, 2011; Still & Precup, 2012; Bellemare et al., 2016; Houthooft et al., 2016; Pathak et al., 2017).”
BackgroundThe Reward-Complexity Trade-off in Schizophrenia
Gershman, S., & Lai, L. (2020) · bioRxiv · doi:10.1101/2020.11.16.385013 · Cited by 20
G-Learning: Taming the Noise in Reinforcement Learning via Soft UpdatesPreprint
Fox, R., Pakman, A., & Tishby, N. (2015) · arXiv.org · doi:10.48550/arxiv.1512.08562 · Cited by 18
“A KL penalty similar to ours is used in [35], in settings with known reward and transition functions, to encourage “curiosity”.”
MethodLearning to Assist Humans without Inferring Rewards
Myers, V., Ellis, E., Levine, S., Eysenbach, B., & Dragan, A. D. (2024) · Neural Information Processing Systems · doi:10.48550/arxiv.2411.02623 · Cited by 18
“Our approach is made possible by advances in contrastive representation learning for efficient estimation of the mutual information of sequence data [35].”
Manrique, H. M., Friston, K. J., & WALKER, M. J. (2024) · Physics of Life Reviews · doi:10.1016/j.plrev.2024.01.004 · Cited by 24
“” [ 56 – 58].”
Gupta, K., Mukherjee, D., & Najjaran, H. (2021) · SN Computer Science · doi:10.1007/s42979-021-00934-9 · Cited by 18
“…reward re-labelling strategies like hindsight experience replay (HER) [5], competitive experience replay (CER) [72] and efficient exploratory techniques like intrinsic motivation [6, 8], curiosity [17, 33, 105] and surprise [3, 95, 125]-based exploration have been successfully demonstrated.”
BackgroundExtrinsic rewards, intrinsic rewards, and non-optimal behavior
Karayanni, M., & Nelken, I. (2022) · Journal of Computational Neuroscience · doi:10.1007/s10827-022-00813-z · Cited by 16
Learning to Plan Optimistically: Uncertainty-Guided Deep Exploration via Latent Model EnsemblesPreprint
Seyde, T., Schwarting, W., Karaman, S., & Rus, D. L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.14641 · Cited by 3
“Information gain techniques define an auxiliary objective that encourages exploration of unexpected environment behavior or model disagreement and have been applied in discrete [37, 38, 39] and continuous actions spaces [40, 41, 42].”
BackgroundAdapting Behaviour via Intrinsic Reward: A Survey and Empirical StudyPreprint
Linke, C., Ady, N. M., White, M., Degris, T., & White, A. (2019) · arXiv.org · doi:10.48550/arxiv.1906.07865 · Cited by 17
“Other measures based on information gain have been explored (Still and Precup, 2012; Little and Sommer, 2013; Achiam and Sastry, 2017; de Abril and Kanai, 2018; Still and Precup, 2012), though they have been found to perform similarly to Bayesian Surprise (Little and Sommer, 2013).”
MethodCombining Experience Replay with Exploration by Random Network Distillation
Sovrano, F. (2019) · IEEE Conference on Games (CoG) · doi:10.1109/cig.2019.8848046 · Cited by 17
“• Intrinsic Motivation [1], [22], [23], [24], [25]: the intrinsic reward is proportional to how much the new state contains new information.”
BackgroundActive inference, preference learning and adaptive behaviour
Sajid, N., Tigas, P., & Friston, K. J. (2022) · IOP Conference Series Materials Science and Engineering · doi:10.1088/1757-899x/1261/1/012020 · Cited by 13
“Popular methods focus on exploration based on information gain (Houthooft et al., 2016; Still and Precup, 2011), prediction error (Achiam and Sastry, Fig.”
MethodUnderstanding the Origin of Information-Seeking Exploration in Probabilistic Objectives for ControlPreprint
Millidge, B., Seth, A. C., & Buckley, C. L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.06859 · Cited by 11
“…solution to this problem for more complex, and especially nonstationary environments, which characterise many of the environments in which humans and other animals must manage this trade-off (Cohen et al., 2007; Jamieson, Malloy, Nowak, & Bubeck, 2014; Kolter & Ng, 2009; Still & Precup, 2012).”
BackgroundState-chain sequential feedback reinforcement learning for path planning of autonomous mobile robots
Ma, X., Xu, Y., Sun, G.-Q., Deng, L.-X., & Li, Y.-B. (2013) · Journal of Zhejiang University SCIENCE C · doi:10.1631/jzus.c1200226 · Cited by 15
Information is Power: Intrinsic Control via Information Capture
Rhinehart, N., Wang, J., Berseth, G., Co-Reyes, J. D., Hafner, D., Finn, C., & Levine, S. (2021) · Neural Information Processing Systems · doi:10.48550/arxiv.2112.03899 · Cited by 14
“Exploration approaches include those that maximize model prediction error or improvement [59, 43, 65, 56], maximize model uncertainty [26, 66, 64, 57, 20], maximize state visitation [4, 19, 69, 25], maximize surprise [59, 1, 67], and employ other novelty-based exploration bonuses [42, 7, 32, 33].”
Background
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