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 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.
翻译:绑定操作是许多认知过程的基础, 如认知地图的形成、 关联推理和语言理解。 在这些过程中, 两种不同的模式, 如位置和目标、 事件及其背景提示、 文字及其作用等, 需要捆绑在一起, 但是对内在神经机制知之甚少。 以前的工作引入了一个基于捆绑配对的二次函数的捆绑模型, 其次是多对的矢量加和。 基于这个框架, 我们处理以下问题: 哪种四边基质最适合解码关系结构? 以及结果的准确性是什么? 我们引入了一个新的捆绑矩阵类别, 以星座代数的矩阵代表形式为基础, 是一个复杂数字的八维扩展。 我们显示这些矩阵能够比以前已知的方法更加准确, 在有少量对配对的情况下, 并随后引入了多对矢量的组合操作方相匹配。 我们还表明, 当有大批捆绑配的对配配配对时, 将随机的二次绑定性演练, 以及内层和先前设定的大脑的绑定性操作机制 。