A Formal Theory of Creativity to Model the Creation of Art

According to the Formal Theory of Creativity (1990–2010), a creative agent—one that never stops generating non-trivial, novel, and surprising behaviours and data—must have two learning components: a general reward optimiser or reinforcement learner, and an adaptive encoder of the agent’s growing data history (the record of the agent’s interaction with its environment). The learning progress of the encoder is the intrinsic reward for the reward optimiser. That is, the latter is motivated to invent interesting spatio-temporal patterns that the encoder does not yet know but can easily learn to encode better with little computational effort. To maximise expected reward (in the absence of external reward), the reward optimiser will create more and more-complex behaviours that yield temporarily surprising (but eventually boring) patterns that make the encoder quickly improve. I have argued that this simple principle explains science, art, music and humour. It is possible to rigorously formalise it and implement it on learning machines, thus building artificial robotic scientists and artists equipped with curiosity and creativity. I summarise my work on this topic since 1990, and present a previously unpublished low-complexity artwork computable by a very short program discovered through active search for novel patterns according to the principles of the theory.

[1]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[2]  Jürgen Schmidhuber,et al.  Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity , 2007, Discovery Science.

[3]  Wilfried Brauer,et al.  Foundations of computer science : potential--theory--cognition , 1997 .

[4]  Jürgen Schmidhuber,et al.  Ultimate Cognition à la Gödel , 2009, Cognitive Computation.

[5]  Tom Schaul,et al.  Coherence Progress: A Measure of Interestingness Based on Fixed Compressors , 2011, AGI.

[6]  J. Schmidhuber Facial beauty and fractal geometry , 1998 .

[7]  C. S. Wallace,et al.  An Information Measure for Classification , 1968, Comput. J..

[8]  H. Franke,et al.  Ästhetik als Informationsverarbeitung , 1974 .

[9]  Immanuel Kant Kritik Der Reinen Vernunft , 2004 .

[10]  Nelson Goodman,et al.  Languages of Art, an Approach to a Theory of Symbols , 1970 .

[11]  Dominic Lopes,et al.  The Routledge Companion to Aesthetics , 2007 .

[12]  Jürgen Schmidhuber,et al.  Optimal Ordered Problem Solver , 2002, Machine Learning.

[13]  SolomonoffR. Complexity-based induction systems , 2006 .

[14]  Jürgen Schmidhuber,et al.  Artificial curiosity based on discovering novel algorithmic predictability through coevolution , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[15]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[16]  S. Hochreiter,et al.  REINFORCEMENT DRIVEN INFORMATION ACQUISITION IN NONDETERMINISTIC ENVIRONMENTS , 1995 .

[17]  Ring Mark,et al.  Compression Progress-Based Curiosity Drive for Developmental Learning , 2011 .

[18]  Faustino J. Gomez,et al.  Intrinsically Motivated Evolutionary Search for Vision-Based Reinforcement Learning , 2011 .

[19]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[20]  A. Kolmogorov Three approaches to the quantitative definition of information , 1968 .

[21]  R. Arnheim,et al.  Information Theory and Esthetic Perception , 1968 .

[22]  Jürgen Schmidhuber,et al.  Sequential neural text compression , 1996, IEEE Trans. Neural Networks.

[23]  Jurgen Schmidhuber,et al.  Artificial curiosity with planning for autonomous perceptual and cognitive development , 2011, 2011 IEEE International Conference on Development and Learning (ICDL).

[24]  Jürgen Schmidhuber,et al.  Shifting Inductive Bias with Success-Story Algorithm, Adaptive Levin Search, and Incremental Self-Improvement , 1997, Machine Learning.

[25]  N. Goodman,et al.  Languages of art : an approach to a theory of symbols , 1979 .

[26]  Jürgen Schmidhuber,et al.  Curious model-building control systems , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[27]  Jürgen Schmidhuber,et al.  Exploring the predictable , 2003 .

[28]  H. Frank Kybernetische Analysen : subjektiver Sachverhalte , 1964 .

[29]  Jürgen Schmidhuber,et al.  Learning Complex, Extended Sequences Using the Principle of History Compression , 1992, Neural Computation.

[30]  Ofi rNw8x'pyzm,et al.  The Speed Prior: A New Simplicity Measure Yielding Near-Optimal Computable Predictions , 2002 .

[31]  Jürgen Schmidhuber,et al.  Formal Theory of Creativity, Fun, and Intrinsic Motivation (1990–2010) , 2010, IEEE Transactions on Autonomous Mental Development.

[32]  Jürgen Schmidhuber,et al.  Driven by Compression Progress: A Simple Principle Explains Essential Aspects of Subjective Beauty, Novelty, Surprise, Interestingness, Attention, Curiosity, Creativity, Art, Science, Music, Jokes , 2008, ABiALS.

[33]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[34]  W. Stolz Information Theory and Esthetic Perception. , 1967 .

[35]  Andrew W. Moore,et al.  Reinforcement Learning: A Survey , 1996, J. Artif. Intell. Res..

[36]  Ray J. Solomonoff,et al.  Complexity-based induction systems: Comparisons and convergence theorems , 1978, IEEE Trans. Inf. Theory.

[37]  C. S. Wallace,et al.  Estimation and Inference by Compact Coding , 1987 .

[38]  J. Piaget The child's construction of reality , 1954 .

[39]  A. Philip McMahon,et al.  The Principles of Art , 1939 .

[40]  Kerstin Eder,et al.  Improving XCS performance on overlapping binary problems , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[41]  D. Berlyne NOVELTY AND CURIOSITY AS DETERMINANTS OF EXPLORATORY BEHAVIOUR1 , 1950 .

[42]  Jürgen Schmidhuber,et al.  A possibility for implementing curiosity and boredom in model-building neural controllers , 1991 .

[43]  N. Goodman,et al.  Languages of Art: An Approach to a Theory of Symbols , 1971 .

[44]  Jürgen Schmidhuber,et al.  Low-Complexity Art , 2017 .

[45]  J. Urgen Schmidhuber A Computer Scientist's View of Life, the Universe, and Everything , 1997 .

[46]  D. Berlyne Conflict, arousal, and curiosity , 2014 .

[47]  W. Wundt,et al.  Grundzüge der physiologischen psyhcologie , 1893 .

[48]  Shigeyoshi Tsutsui,et al.  Advances in Evolutionary Computing , 2003 .

[49]  Jürgen Schmidhuber,et al.  Hierarchies of Generalized Kolmogorov Complexities and Nonenumerable Universal Measures Computable in the Limit , 2002, Int. J. Found. Comput. Sci..

[50]  Konrad Zuse,et al.  Rechnender Raum , 1991, Physik und Informatik.

[51]  J. Schmidhuber Don't forget randomness is still just a hypothesis , 2006, Nature.

[52]  J. Schmidhuber Science as By-Products of Search for Novel Patterns , or Data Compressible in Unknown Yet Learnable Ways , 2009 .

[53]  Jürgen Schmidhuber,et al.  A Computer Scientist's View of Life, the Universe, and Everything , 1999, Foundations of Computer Science: Potential - Theory - Cognition.

[54]  M. Bense Einführung in die informationstheoretische Ästhetik , 1969 .

[55]  Martin V. Butz,et al.  Anticipatory Behavior in Adaptive Learning Systems , 2003, Lecture Notes in Computer Science.

[56]  Jürgen Schmidhuber,et al.  Developmental robotics, optimal artificial curiosity, creativity, music, and the fine arts , 2006, Connect. Sci..

[57]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[58]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

[59]  Jürgen Schmidhuber,et al.  Simple algorithmic theory of subjective beauty, novelty, surprise, interestingness, attention, curiosity, creativity, art, science, music, jokes (特集 高次機能の学習と創発--脳・ロボット・人間研究における新たな展開) , 2009 .

[60]  D. Huffman A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[61]  Arthur C. Danto,et al.  The Transfiguration of the Commonplace , 1974 .

[62]  Marcus Hutter,et al.  Universal Artificial Intellegence - Sequential Decisions Based on Algorithmic Probability , 2005, Texts in Theoretical Computer Science. An EATCS Series.

[63]  Tom Schaul,et al.  Curiosity-driven optimization , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[64]  Tao Xiong,et al.  A combined SVM and LDA approach for classification , 2005, Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005..