Pith. sign in

REVIEW 3 cited by

Emergent Symbols through Binding in External Memory

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.14601 v2 pith:Y5POWQ5W submitted 2020-12-29 cs.AI cs.LGcs.NE

classification cs.AIcs.LGcs.NE
keywords rulesnetworkbindingabstractcapacitydatadirectlyemergent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. RESOLVE: Relational Reasoning with Symbolic and Object-Level Features Using Vector Symbolic Processing

    cs.AI 2024-11 conditional novelty 6.0 of 10

    RESOLVE combines vector symbolic computing with an attention mechanism to improve few-shot accuracy on relational reasoning tasks such as sorting and math problem solving.

  2. Systematic Abductive Reasoning via Diverse Relation Representations in Vector-symbolic Architecture

    cs.AI 2025-01 conditional novelty 5.0 of 10

    Rel-SAR, a vector-symbolic architecture with numeric, circular, and boolean vectors, improves accuracy on Raven's Progressive Matrices, particularly for position-based rules.

  3. A Vision Toward Energy-Efficient Domain-Specific Artificial Intelligence Models and Agents

    cs.AI 2025-10 unverdicted novelty 2.0 of 10

    A position paper proposing compact, domain-specific AI agents as the path to ≥1000× energy efficiency, without demonstrating the claim.

Pith tools