Evidence map›Paper›PMID 34478381›Full record

ArticleIEEE transactions on neural networks and learning systems2023

Variable Binding for Sparse Distributed Representations: Theory and Applications.

Edward Paxon Frady, Denis Kleyko, Friedrich T Sommer

Open access · greenAbstract read
In one paragraph

Article in IEEE transactions on neural networks and learning systems, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.

0numbers the graph read from it
0cells of the map it votes in
11citing papers in PubMed
1.0field-weighted citation impact, top 25% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

11 citing papers in PubMed, 13 citations in OpenAlex.

  1. Article
  2. Article
  3. Perceptron Theory Can Predict the Accuracy of Neural Networks.IEEE transactions on neural networks and learning systems · 2024
    Article
  4. Article
  5. Hyperdimensional computing with holographic and adaptive encoder.Frontiers in artificial intelligence · 2024
    Article
  6. Article
  7. Article
  8. Vector Symbolic Architectures as a Computing Framework for Emerging Hardware.Proceedings of the IEEE. Institute of Electrical and Electronics Engineers · 2022
    Article
  9. Cellular Automata Can Reduce Memory Requirements of Collective-State Computing.IEEE transactions on neural networks and learning systems · 2022
    Article
  10. Article
  11. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors at 2 institutions in 1 country.

Edward Paxon Frady
Denis Kleyko
Friedrich T Sommer
Intel (United States) · USCenter for Theoretical Biological Physics · US

Funding

Building analysis tools and a theory framework for inferring principles of neural computation from multi-scale organization in brain recordingsR01EB026955 · NIBIB · UNIVERSITY OF CALIFORNIA BERKELEY · PI SOMMER, FRIEDRICH T · 2018 to 2020
$1.1M
NIBIB NIH HHS R01 EB026955
6 · The paper itself

Abstract

Variable binding is a cornerstone of symbolic reasoning and cognition. But how binding can be implemented in connectionist models has puzzled neuroscientists, cognitive psychologists, and neural network researchers for many decades. One type of connectionist model that naturally includes a binding operation is vector symbolic architectures (VSAs). In contrast to other proposals for variable binding, the binding operation in VSAs is dimensionality-preserving, which enables representing complex hierarchical data structures, such as trees, while avoiding a combinatoric expansion of dimensionality. Classical VSAs encode symbols by dense randomized vectors, in which information is distributed throughout the entire neuron population. By contrast, in the brain, features are encoded more locally, by the activity of single neurons or small groups of neurons, often forming sparse vectors of neural activation. Following Laiho et al. (2015), we explore symbolic reasoning with a special case of sparse distributed representations. Using techniques from compressed sensing, we first show that variable binding in classical VSAs is mathematically equivalent to tensor product binding between sparse feature vectors, another well-known binding operation which increases dimensionality. This theoretical result motivates us to study two dimensionality-preserving binding methods that include a reduction of the tensor matrix into a single sparse vector. One binding method for general sparse vectors uses random projections, the other, block-local circular convolution, is defined for sparse vectors with block structure, sparse block-codes. Our experiments reveal that block-local circular convolution binding has ideal properties, whereas random projection based binding also works, but is lossy. We demonstrate in example applications that a VSA with block-local circular convolution and sparse block-codes reaches similar performance as classical VSAs. Finally, we discuss our results in the context of neuroscience and neural networks.

Indexed as

CognitionNeural Networks, ComputerBrainNeuronsProblem Solving

Identifiers

PMID34478381
PMCPMC12180425
OpenAlexW3087092958

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.