SwePub
Sök i LIBRIS databas

  Utökad sökning

L773:2162 237X
 

Sökning: L773:2162 237X > Variable Binding fo...

Variable Binding for Sparse Distributed Representations : Theory and Applications

Frady, Edward Paxon (författare)
Intel Labs, USA; University of California, USA
Kleyko, Denis (författare)
RISE,Datavetenskap,Intel Labs, USA
Sommer, Friedrich T (författare)
Intel Labs, USA; University of California
 (creator_code:org_t)
Institute of Electrical and Electronics Engineers Inc. 2023
2023
Engelska.
Ingår i: IEEE Transactions on Neural Networks and Learning Systems. - : Institute of Electrical and Electronics Engineers Inc.. - 2162-237X .- 2162-2388. ; 34:5, s. 2191-2204
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • 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. 

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences (hsv//eng)

Nyckelord

Brain; Compressed sensing; Convolution; Data structures; Matrix algebra; Network architecture; Neural networks; Neurons; Tensors; Trees (mathematics)
Cognition; Cognitive reasoning; Compound; Compressed sensing; Compressed-Sensing; Distributed representation; Sparse block code; Sparse distributed representation; Sparse matrices; Tensor product variable binding; Tensor products; Variable binding; Vector symbolic architecture .
Vectors
artificial neural network; brain; cognition; nerve cell; physiology; problem solving
Brain; Cognition; Neural Networks
Computer; Neurons; Problem Solving

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Hitta mer i SwePub

Av författaren/redakt...
Frady, Edward Pa ...
Kleyko, Denis
Sommer, Friedric ...
Om ämnet
NATURVETENSKAP
NATURVETENSKAP
och Data och informa ...
Artiklar i publikationen
IEEE Transaction ...
Av lärosätet
RISE

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy