Optimal Quadratic Binding for Relational Reasoning in Vector Symbolic Neural Architectures.
Journal
Neural computation
ISSN: 1530-888X
Titre abrégé: Neural Comput
Pays: United States
ID NLM: 9426182
Informations de publication
Date de publication:
20 01 2023
20 01 2023
Historique:
received:
18
04
2022
accepted:
13
09
2022
pubmed:
22
12
2022
medline:
31
1
2023
entrez:
21
12
2022
Statut:
ppublish
Résumé
Binding operation is fundamental to many cognitive processes, such as cognitive map formation, relational reasoning, and language comprehension. In these processes, two different modalities, such as location and objects, events and their contextual cues, and words and their roles, need to be bound together, but little is known about the underlying neural mechanisms. Previous work has introduced a binding model based on quadratic functions of bound pairs, followed by vector summation of multiple pairs. Based on this framework, we address the following questions: Which classes of quadratic matrices are optimal for decoding relational structures? And what is the resultant accuracy? We introduce a new class of binding matrices based on a matrix representation of octonion algebra, an eight-dimensional extension of complex numbers. We show that these matrices enable a more accurate unbinding than previously known methods when a small number of pairs are present. Moreover, numerical optimization of a binding operator converges to this octonion binding. We also show that when there are a large number of bound pairs, however, a random quadratic binding performs, as well as the octonion and previously proposed binding methods. This study thus provides new insight into potential neural mechanisms of binding operations in the brain.
Identifiants
pubmed: 36543330
pii: 114138
doi: 10.1162/neco_a_01558
doi:
Types de publication
Journal Article
Langues
eng
Sous-ensembles de citation
IM
Pagination
105-155Informations de copyright
© 2022 Massachusetts Institute of Technology.