bioRxiv · 10.1101/2020.07.28.225318
Efficiency of local learning rules in threshold-linear associative networks
Abstract
We show that associative networks of threshold linear units endowed with Hebbian learning can operate closer to the Gardner optimal storage capacity than their binary counterparts and even surpass this bound. This is largely achieved through a sparsification of the retrieved patterns, which we analyze for theoretical and empirical distributions of activity. As reaching the optimal capacity via non-local learning rules like back-propagation requires slow and neurally implausible training procedures, our results indicate that one-shot self-organized Hebbian learning can be just as efficient.
Source connections
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Schonsberg, F., Roudi, Y., Treves, A.. 2020-07-29. Efficiency of local learning rules in threshold-linear associative networks. https://doi.org/10.1101/2020.07.28.225318
Cite the original work for its findings. Save a collection to share your selection of sources.