Emergent Symbols through Binding in External Memory
Taylor Whittington Webb, Ishan Sinha, Jonathan D. Cohen
Abstract
A key aspect of human intelligence is the ability to infer abstract rules directly from high-dimensional sensory data, and to do so given only a limited amount of training experience. Deep neural network algorithms have proven to be a powerful tool for learning directly from high-dimensional data, but currently lack this capacity for data-efficient induction of abstract rules, leading some to argue that symbol-processing mechanisms will be necessary to account for this capacity. In this work, we take a step toward bridging this gap by introducing the Emergent Symbol Binding Network (ESBN), a recurrent network augmented with an external memory that enables a form of variable-binding and indirection. This binding mechanism allows symbol-like representations to emerge through the learning process without the need to explicitly incorporate symbol-processing machinery, enabling the ESBN to learn rules in a manner that is abstracted away from the particular entities to which those rules apply. Across a series of tasks, we show that this architecture displays nearly perfect generalization of learned rules to novel entities given only a limited number of training examples, and outperforms a number of other competitive neural network architectures.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 5bedf281-27f4-430c-adfa-288c1b81b36aCited by top-tier papers15
- Systematic Visual Reasoning through Object-Centric Relational AbstractionTaylor W. Webb, Shanka Subhra Mondal, Jonathan D. CohenNeurIPS 2023 · 35 citations
- Discrete Key-Value BottleneckFrederik Träuble, Anirudh Goyal, Nasim Rahaman, Michael Curtis Mozer et al.ICML 2023 · 25 citations
- When can transformers reason with abstract symbols?Enric Boix-Adserà, Omid Saremi, Emmanuel Abbe, Samy Bengio et al.ICLR 2024 · 21 citations
- Compositional Attention: Disentangling Search and RetrievalSarthak Mittal, Sharath Chandra Raparthy, Irina Rish, Yoshua Bengio et al.ICLR 2022 · 20 citations
- Abstractors and relational cross-attention: An inductive bias for explicit relational reasoning in TransformersAwni Altabaa, Taylor Whittington Webb, Jonathan D. Cohen, John LaffertyICLR 2024 · 13 citations
Builds on5
- Object-Centric Learning with Slot AttentionFrancesco Locatello, Dirk Weissenborn, Thomas Unterthiner, Aravindh Mahendran et al.NeurIPS 2020 · 1,275 citations
- Learning Compositional Rules via Neural Program SynthesisMaxwell I. Nye, Armando Solar-Lezama, Josh Tenenbaum, Brenden M. LakeNeurIPS 2020 · 120 citations
- Grounded Language Learning Fast and SlowFelix Hill, Olivier Tieleman, Tamara von Glehn, Nathaniel Wong et al.ICLR 2021 · 85 citations
- An Explicitly Relational Neural Network ArchitectureMurray Shanahan, Kyriacos Nikiforou, Antonia Creswell, Christos Kaplanis et al.ICML 2020 · 72 citations
- Learning Representations that Support ExtrapolationTaylor W. Webb, Zachary Dulberg, Steven Frankland, Alexander A. Petrov et al.ICML 2020 · 60 citations
Related papers
- How Do Transformers Learn Variable Binding in Symbolic Programs?Yiwei Wu, Atticus Geiger, Raphaël MillièreICML 2025
- Compositional Generalization by Learning Analytical ExpressionsQian Liu, Shengnan An, Jian-Guang Lou, Bei Chen et al.NeurIPS 2020 · 79 citations
- Recognizing and Verifying Mathematical Equations using Multiplicative Differential Neural UnitsAnkur Mali, Alexander G. Ororbia II, Daniel Kifer, C. Lee GilesAAAI 2021 · 16 citations
- Emergent Symbolic Mechanisms Support Abstract Reasoning in Large Language ModelsYukang Yang, Declan Campbell, Kaixuan Huang, Mengdi Wang et al.ICML 2025
- Neural-Symbolic Recursive Machine for Systematic GeneralizationQing Li, Yixin Zhu, Yitao Liang, Ying Nian Wu et al.ICLR 2024 · 15 citations
