Programmed interactions in higher-order neural networks: Maximal capacity

DOI10.1016/0885-064X(91)90040-5MaRDI QIDQ1179461zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Programmed interactions in higher-order neural networks: The outer- product algorithm
• Information storage in high-order neural networks with unequal neural activity
• Dense memory with high order neural networks
• The space of interactions in neural network models

Cites work

• scientific article; zbMATH DE number 67607 (Why is no real title available?)
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A Problem in Geometric Probability.
• A logical calculus of the ideas immanent in nervous activity
• Enumeration of Seven-Argument Threshold Functions
• Information capacity of the Hopfield model
• Neural networks and physical systems with emergent collective computational abilities
• Neural networks, orientations of the hypercube, and algebraic threshold functions
• Programmed interactions in higher-order neural networks: The outer- product algorithm
• Random interactions in higher order neural networks
• Random polytopes in the d-dimensional cube

Cited in

(6)

• A review of combinatorial problems arising in feedforward neural network design
• Effect of spatial correlations on Hopfield neural network and dense associative memories
• Information storage in high-order neural networks with unequal neural activity
• Memory and forecasting capacities of nonlinear recurrent networks
• Programmed interactions in higher-order neural networks: The outer- product algorithm
• On the complexity of computing and learning with multiplicative neural networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1179461)