Programmed interactions in higher-order neural networks: Maximal capacity

DOI10.1016/0885-064X(91)90040-5zbMath0738.68066OpenAlexW2038238727MaRDI QIDQ1179461

Santosh S. Venkatesh, Pierre Baldi

Publication date: 26 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(91)90040-5

zbMATH Keywords

storage capacityspectral algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20)

Related Items (4)

A review of combinatorial problems arising in feedforward neural network design ⋮ Effect of spatial correlations on Hopfield neural network and dense associative memories ⋮ Programmed interactions in higher-order neural networks: The outer- product algorithm ⋮ On the Complexity of Computing and Learning with Multiplicative Neural Networks

Cites Work

• Unnamed Item
• Random polytopes in the d-dimensional cube
• Programmed interactions in higher-order neural networks: The outer- product algorithm
• Information capacity of the Hopfield model
• Neural networks, orientations of the hypercube, and algebraic threshold functions
• A Problem in Geometric Probability.
• Random interactions in higher order neural networks
• Neural networks and physical systems with emergent collective computational abilities.
• Enumeration of Seven-Argument Threshold Functions
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: Programmed interactions in higher-order neural networks: Maximal capacity