Can we separate learnable surprise from random noise?
Novelty search and the free-energy principle both fail by treating all surprise equally. What if we split learnable surprise from unlearnable noise and pursue only the learnable kind?
The paper opens with a diagnosis of the two most influential drives for intelligence. Novelty search, which seeks surprise, "is transfixed by a noisy television screen", while the free-energy principle, which avoids surprise, "is most content in a dark room". The abstract says "both failures have a single cause": each objective treats as one quantity "the surprise a learner can convert into knowledge and the surprise it never can". The proposed fix is to separate out the learnable part, which the authors call learnable novelty, and pursue only that.
The paper's stronger claim is that this one quantity accounts for three things usually studied apart: complexity generation, abstraction and exploration. In the discussion, a single quantity "evaluated by a fixed observer of a single construction" produces all three. Read as a measure, it recovers the classical complexity ordering of the elementary cellular automata without supervision, placing rule 110, the one rule proven Turing-complete, at the top. Ascended as an objective, its gradient carries a neural cellular automaton from simple dynamics into a regime of complex solitons and organizes an image encoder's representation around the MNIST digit classes although no label entered training. Given to an agent as intrinsic reward, it improves on the task reward in nine of ten environments and collapses in none. The authors read these as "projections of one quantity, learnable novelty, onto dynamics, representations, and behavior". The estimator is described as closed-form, built on a cheap and differentiable reservoir computer.
This sits close to What can a bounded observer actually learn from data?, which also splits what a bounded observer can extract from what only looks like information, with pseudorandom and chaotic sources as the noise case. The parallel is in the structure of the move: both refuse to count unlearnable randomness as information. The difference is the use. Epiplexity is framed as a task-free basis for choosing data, while learnable novelty is offered as a drive and a reward signal. It also gives a reason to read Do language models fail at reasoning due to complexity or novelty? with care. There, novelty is the thing that breaks a model. Here, novelty is the thing to pursue, so long as the observer can convert it into knowledge. The two are compatible if what matters is learnability at the observer's current state rather than novelty as such. Compare Can simple rewards alone teach complex domain reasoning?, where complex capability emerges from a simple extrinsic reward. Here the simple signal is intrinsic and is credited with supplying the exploration that task rewards lack.
The excerpt gives no definition of the estimator beyond "closed-form" and "reservoir computer". It reports no baselines for the nine-of-ten result, no names for the environments and no size for the improvement. It does not say how the fixed observer is chosen or how sensitive the results are to that choice. It also does not say whether the quantity is related to earlier bounded-observer measures. The claim that the three phenomena "were never independent" is the authors' reading of these results, worded as "these results suggest". What the excerpt supports is a clear diagnosis of why the two standard drives fail and an unusually broad demonstration that one measure can serve as metric, objective and reward. It does not show the measure to be the single principle of intelligence.
Inquiring lines that read this note 1
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
How do surface patterns enable correct outputs but reduce robustness?Related concepts in this collection 4
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
What can a bounded observer actually learn from data?
Classical information measures treat all high-entropy content equally, but computationally bounded learners can only extract certain types of structure. What distinguishes learnable regularity from random noise that bounded agents face?
parallel bounded-observer split between learnable structure and noise, used there for data selection and here as a drive and reward
-
Do language models fail at reasoning due to complexity or novelty?
Explores whether reasoning-model failures stem from task complexity thresholds or from encountering unfamiliar instances. Tests whether scaling chain length actually addresses the root cause of reasoning breakdown.
treats novelty as the failure point; this paper treats learnable novelty as the thing worth pursuing
-
Can simple rewards alone teach complex domain reasoning?
Does reinforcement learning on difficult problems with basic accuracy rewards produce sophisticated reasoning strategies without explicit chain-of-thought training? This challenges assumptions about what domain AI models need to learn effectively.
capability from a simple extrinsic reward; here one intrinsic signal is said to supply the missing exploration
-
Why do Shannon and Kolmogorov measures fail to value data?
Shannon information and Kolmogorov complexity assume unlimited computational capacity. But do these classical measures actually capture what bounded learners can extract from real data?
Extends: Shannon information and Kolmogorov complexity also fail to capture learnable value of data, because they assume observers with unlimited compute
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Intelligence from Learnable Novelty
- From Entropy to Epiplexity: Rethinking Information for Computationally Bounded Intelligence
- Beyond the Exploration-Exploitation Trade-off: A Hidden State Approach for LLM Reasoning in RLVR
- Diffusion Models are Evolutionary Algorithms
- There Will Be a Scientific Theory of Deep Learning
- Progress Measures For Grokking Via Mechanistic Interpretability
- Large Language Models Think Too Fast To Explore Effectively
- Intrinsically Motivated Graph Exploration Using Network Theories of Human Curiosity
Original note title
novelty search and the free-energy principle fail in mirror image because both treat learnable and unlearnable surprise as one quantity