Formal Theory of Creativity, Fun, and Intrinsic Motivation (1990–2010)
Top Cited Papers
- 12 July 2010
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Autonomous Mental Development
- Vol. 2 (3), 230-247
- https://doi.org/10.1109/tamd.2010.2056368
Abstract
The simple, but general formal theory of fun and intrinsic motivation and creativity (1990-2010) is based on the concept of maximizing intrinsic reward for the active creation or discovery of novel, surprising patterns allowing for improved prediction or data compression. It generalizes the traditional field of active learning, and is related to old, but less formal ideas in aesthetics theory and developmental psychology. It has been argued that the theory explains many essential aspects of intelligence including autonomous development, science, art, music, and humor. This overview first describes theoretically optimal (but not necessarily practical) ways of implementing the basic computational principles on exploratory, intrinsically motivated agents or robots, encouraging them to provoke event sequences exhibiting previously unknown, but learnable algorithmic regularities. Emphasis is put on the importance of limited computational resources for online prediction and compression. Discrete and continuous time formulations are given. Previous practical, but nonoptimal implementations (1991, 1995, and 1997-2002) are reviewed, as well as several recent variants by others (2005-2010). A simplified typology addresses current confusion concerning the precise nature of intrinsic motivation.Keywords
This publication has 64 references indexed in Scilit:
- Bayesian surprise attracts human attentionVision Research, 2008
- What is intrinsic motivation? A typology of computational approachesFrontiers in Neurorobotics, 2007
- From unknown sensors and actuators to actions grounded in sensorimotor perceptionsConnection Science, 2006
- Bootstrap learning of foundational representationsConnection Science, 2006
- Don't forget randomness is still just a hypothesisNature, 2006
- Low-Complexity ArtPublished by JSTOR ,1997
- A computer scientist's view of life, the universe, and everythingLecture Notes in Computer Science, 1997
- The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spacesMachine Learning, 1995
- A Local Learning Algorithm for Dynamic Feedforward and Recurrent NetworksConnection Science, 1989
- Complexity-based induction systems: Comparisons and convergence theoremsIEEE Transactions on Information Theory, 1978