Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity
Juergen Schmidhuber

TL;DR
This paper proposes a unified theory where curiosity, beauty, and creativity emerge from an agent's drive to improve data compressibility, leading to discovery and innovation in both artificial and human contexts.
Contribution
It introduces a principle linking curiosity and creativity to the improvement of data compression, providing a computational framework for understanding discovery and artistic creativity.
Findings
Agents seek to maximize the rate of improvement in data compressibility.
Discovery is characterized as a significant breakthrough in data compression.
Qualitative examples illustrate the theory's relevance to human creativity.
Abstract
I postulate that human or other intelligent agents function or should function as follows. They store all sensory observations as they come - the data is holy. At any time, given some agent's current coding capabilities, part of the data is compressible by a short and hopefully fast program / description / explanation / world model. In the agent's subjective eyes, such data is more regular and more "beautiful" than other data. It is well-known that knowledge of regularity and repeatability may improve the agent's ability to plan actions leading to external rewards. In absence of such rewards, however, known beauty is boring. Then "interestingness" becomes the first derivative of subjective beauty: as the learning agent improves its compression algorithm, formerly apparently random data parts become subjectively more regular and beautiful. Such progress in compressibility is measured and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCreativity in Education and Neuroscience
