Reduction of interconnection weights in higher order associative memory networks
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The existence of principal connection weights Tpr useful in solving the problem of proliferation of weights in higher-order Hebbian-type associative memories is introduced and it is shown that those weights near square root M, where M=number of stored patterns, contain, more information than the others.
Abstract
The existence of principal connection weights Tpr useful in solving the problem of proliferation of weights in higher-order Hebbian-type associative memories is introduced. Among all connection weights T based on the outer-product rule, it is shown that those weights near square root M, where M=number of stored patterns, contain, more information than the others. The recall capability of Hopfield associative memories which use only principal weights Tpr, where Tpr in T and square root M>