arXiv · cond-mat/9611130
Learning by dilution in a Neural Network
Abstract
A perceptron with N random weights can store of the order of N patterns by removing a fraction of the weights without changing their strengths. The critical storage capacity as a function of the concentration of the remaining bonds for random outputs and for outputs given by a teacher perceptron is calculated. A simple Hebb-like dilution algorithm is presented which in the teacher case reaches the optimal generalization ability.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
B. Lopez, W. Kinzel. 1996-11-18. Learning by dilution in a Neural Network. https://doi.org/10.1088/0305-4470%2F30%2F22%2F014
Cite the original work for its findings. Save a collection to share your selection of sources.