Optimal quadratic binding for relational reasoning in vector symbolic neural architectures
Naoki Hiratani, Haim Sompolinsky

TL;DR
This paper investigates optimal quadratic binding matrices for relational reasoning in neural architectures, introducing octonion-based matrices that improve unbinding accuracy with few pairs and analyzing their performance relative to other methods.
Contribution
It introduces a novel class of quadratic binding matrices based on octonion algebra, demonstrating their effectiveness in relational decoding tasks.
Findings
Octonion-based matrices enable more accurate unbinding with few pairs.
Random quadratic binding performs similarly with many pairs.
Numerical optimization converges to octonion binding.
Abstract
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 works introduced a binding model based on quadratic functions of bound pairs, followed by vector summation of multiple pairs. Based on this framework, we address 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Neural Networks and Reservoir Computing · Constraint Satisfaction and Optimization
