mlsanityData to 14 Oct 2026

Intelligence from Learnable Novelty

arXiv 2607.18433 ↗First posted 20 Jul 2026cs.LG cs.AI nlin.AOcited by 2

Not on the map. Why?

Abstract (arXiv)

Intelligence appears under different names in different fields: as data compression in statistics and machine learning, as universal computation in dynamical systems, and as adaptive behavior in agents. Each field carries its own objective, and the two most influential drives often fail in mirror image: 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. 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. Here we show that the learnable part of that information, which we call learnable novelty, yields the seemingly disparate projections of intelligence, and we give a closed-form estimator of it built on a cheap and differentiable reservoir computer. Used as a measure, with no supervision of any kind, the estimator recovers decades of complexity classification, ranking the Turing-complete rule~110 highest among the elementary cellular automata. Used as an objective, its gradient carries a neural cellular automaton from simple dynamics into a regime of solitons, the traveling, colliding structures by which rule~110 computes, as well as organizes the representation of an image encoder around the ten digit classes of MNIST, fully unsupervised: no label ever enters training. Handed to a reinforcement-learning agent as an intrinsic reward, it supplies the exploration that task rewards lack, improving on the task baseline in nine of ten environments and collapsing in none. Complexity generation, abstraction, and exploration, ordinarily pursued with unrelated objectives in separate fields, thus emerge from ascent on one differentiable quantity, and the projections of intelligence gain a common quantitative footing.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 12 of its 46 references that are in the map. First posted on arXiv 20 Jul 2026.

Builds on

12 of 46 references.

References · 12

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2016Understanding intermediate layers using linear classifier probescited by 1,353
  3. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
  4. 2018Exploration by Random Network Distillationcited by 993
  5. 2016Exponential expressivity in deep neural networks through transient chaoscited by 261
  6. 2023Language Modeling Is Compressioncited by 225
  7. 2016Deep Information Propagationcited by 195
  8. 2020Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reductioncited by 142
  9. 2018The Description Length of Deep Learning Modelscited by 72
  10. 2013Empowerment -- an Introductioncited by 68
  11. 2026From Entropy to Epiplexity: Rethinking Information for Computationally Bounded Intelligencecited by 41
  12. 2026Neural Weight Norm = Kolmogorov Complexitycited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Emergent Abilities in Large Language Models: A Survey
  2. 2026Emergence of Physical Intelligence via Controllable Information Production
  3. 2022On the Principles of Parsimony and Self-Consistency for the Emergence of Intelligence
  4. 2021A brain basis of dynamical intelligence for AI and computational neuroscience
  5. 2026Knowledge transfer between simple discrete worlds
  6. 2026Imaginative Generative AI: Crossing the Entropy Wall into Worlds Beyond Imitation
  7. 2025Less is More: some Computational Principles based on Parcimony, and Limitations of Natural Intelligence
  8. 2026A Mathematical Theory of Agency and Intelligence