Programmed interactions in higher-order neural networks: Maximal capacity
From MaRDI portal
Publication:1179461
DOI10.1016/0885-064X(91)90040-5zbMATH Open0738.68066OpenAlexW2038238727MaRDI QIDQ1179461FDOQ1179461
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
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Neural networks and physical systems with emergent collective computational abilities
- Enumeration of Seven-Argument Threshold Functions
- A logical calculus of the ideas immanent in nervous activity
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Title not available (Why is that?)
- A Problem in Geometric Probability.
- Information capacity of the Hopfield model
- Neural networks, orientations of the hypercube, and algebraic threshold functions
- Random polytopes in the d-dimensional cube
- Programmed interactions in higher-order neural networks: The outer- product algorithm
- Random interactions in higher order neural networks
Cited In (6)
- Memory and forecasting capacities of nonlinear recurrent networks
- Programmed interactions in higher-order neural networks: The outer- product algorithm
- A review of combinatorial problems arising in feedforward neural network design
- Information storage in high-order neural networks with unequal neural activity
- On the complexity of computing and learning with multiplicative neural networks
- Effect of spatial correlations on Hopfield neural network and dense associative memories
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)
