Covering cubes by random half cubes, with applications to binary neural networks

DOI10.1006/jcss.1997.1560zbMath0948.68163OpenAlexW2050173734MaRDI QIDQ1271555

James R. Roche, Jeong Han Kim

Publication date: 10 November 1998

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1997.1560

zbMATH Keywords

binary neural networkscovering cubesrandom half cubes

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Learning and adaptive systems in artificial intelligence (68T05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Artificial intelligence (68T99)

Related Items (3)

Storage capacity in symmetric binary perceptrons ⋮ Intersecting random half cubes ⋮ Sharp threshold for the Ising perceptron model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Self-organization and associative memory
• Learning binary perceptrons perfectly efficiently.
• Random polytopes in the d-dimensional cube
• Analytic study of the memory storage capacity of a neural network
• The existence of persistent states in the brain
• A Problem in Geometric Probability.
• Generalization properties of multilayered neural networks
• The capacity of majority rule
• Neural networks and physical systems with emergent collective computational abilities.
• The space of interactions in neural network models
• Enumeration of Seven-Argument Threshold Functions
• A logical calculus of the ideas immanent in nervous activity

This page was built for publication: Covering cubes by random half cubes, with applications to binary neural networks