mlsanityData to 14 Oct 2026

Making sense of sensory input

arXiv 1910.02227 ↗First posted 5 Oct 2019cs.AIcited by 29

Not on the map. Why?

Abstract (arXiv)

This paper attempts to answer a central question in unsupervised learning: what does it mean to "make sense" of a sensory sequence? In our formalization, making sense involves constructing a symbolic causal theory that both explains the sensory sequence and also satisfies a set of unity conditions. The unity conditions insist that the constituents of the causal theory -- objects, properties, and laws -- must be integrated into a coherent whole. On our account, making sense of sensory input is a type of program synthesis, but it is unsupervised program synthesis. Our second contribution is a computer implementation, the Apperception Engine, that was designed to satisfy the above requirements. Our system is able to produce interpretable human-readable causal theories from very small amounts of data, because of the strong inductive bias provided by the unity conditions. A causal theory produced by our system is able to predict future sensor readings, as well as retrodict earlier readings, and impute (fill in the blanks of) missing sensory readings, in any combination. We tested the engine in a diverse variety of domains, including cellular automata, rhythms and simple nursery tunes, multi-modal binding problems, occlusion tasks, and sequence induction intelligence tests. In each domain, we test our engine's ability to predict future sensor values, retrodict earlier sensor values, and impute missing sensory data. The engine performs well in all these domains, significantly out-performing neural net baselines. We note in particular that in the sequence induction intelligence tests, our system achieved human-level performance. This is notable because our system is not a bespoke system designed specifically to solve intelligence tests, but a general-purpose system that was designed to make sense of any sensory sequence.

Key facts. Cited by 29 papers in the map (data through 14 Oct 2026). First posted on arXiv 5 Oct 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 10; 2022: 7; 2023: 4; 2024: 3; 2025: 4; 2026: 1.

29 papers.

Sort:

By area:

  1. 2021Abstraction and Analogy-Making in Artificial Intelligencecited by 103
  2. 2021Neural Production Systems: Learning Rule-Governed Visual Dynamicscited by 75
  3. 2021Inductive logic programming at 30cited by 47
  4. 2022Abstraction for Deep Reinforcement Learningcited by 19
  5. 2023Learning MDL logic programs from noisy datacited by 15
  6. 2021Predicate Invention by Learning From Failurescited by 9
  7. 2023Learning Symbolic Representations Through Joint GEnerative and DIscriminative Trainingcited by 8
  8. 2022Learning logic programs by combining programscited by 7
  9. 2024Relational decomposition for program synthesiscited by 6
  10. 2022Learning First-Order Rules with Differentiable Logic Program Semanticscited by 5
  11. 2022Learning logic programs by discovering where not to searchcited by 4
  12. 2024Learning big logical rules by joining small rulescited by 4
17 more
  1. 2024Variable Assignment Invariant Neural Networks for Learning Logic Programscited by 4
  2. 2021The Artificial Scientist: Logicist, Emergentist, and Universalist Approaches to Artificial General Intelligencecited by 3
  3. 2021Intensional Artificial Intelligence: From Symbol Emergence to Explainable and Empathetic AIcited by 2
  4. 2021Adapting the Function Approximation Architecture in Online Reinforcement Learningcited by 2
  5. 2022Learning programs with magic valuescited by 2
  6. 2022Relational program synthesis with numerical reasoningcited by 2
  7. 2025Visual Graph Question Answering with ASP and LLMs for Language Parsingcited by 2
  8. 2021Learning logic programs through divide, constrain, and conquercited by 1
  9. 2023Learning logic programs by discovering higher-order abstractionscited by 1
  10. 2021Learning logic programs by explaining their failurescited by 0
  11. 2021Parallel Constraint-Driven Inductive Logic Programmingcited by 0
  12. 2022Language-Based Causal Representation Learningcited by 0
  13. 2023A Recursive Bateson-Inspired Model for the Generation of Semantic Formal Concepts from Spatial Sensory Datacited by 0
  14. 2025An Empirical Comparison of Cost Functions in Inductive Logic Programmingcited by 0
  15. 2025Honey, I shrunk the hypothesis space (through logical preprocessing)cited by 0
  16. 2025Symmetry breaking for inductive logic programmingcited by 0
  17. 2026Continual learning and refinement of causal models through dynamic predicate inventioncited by 0