Programmed interactions in higher-order neural networks: The outer-product algorithm

Santosh S Venkatesht, Pierre Baldi
1991 Journal of Complexity  
Recent results on the memory storage capacity of the outer-product algorithm indicate that the algorithm stores of the order of n/log n memories in a network of n fully interconnected linear threshold elements when it is required that each memory be exactly recovered from a probe which is close enough to it. In this paper a rigourous analysis is presented of generalizations of the outer-product algorithm to higher-order networks of densely interconnected polynomial threshold units of degree d.
more » ... recise notions of memory storage capacity are formulated, and it is demonstrated that both static and dynamic storage capacities of all variants of the outer-product algorithm of degree d are of the order of rid/log n. ' Higher-order neural with random interactions lead to rather different computational issues. We deaf with these in a concurrent paper (Venkatesh and Baldi, 1989a ). MEMORY IN HIGHER-ORDER NEURAL NETWORKS 445
doi:10.1016/0885-064x(91)90030-2 fatcat:t2irbp7i3bemxizradhzriid5u