Work

Efficiency of Local Learning Rules in Threshold-Linear Associative Networks

Year: 2021
Type: article
Abstract: We derive the Gardner storage capacity for associative networks of threshold linear units, and show that with Hebbian learning they can operate closer to such Gardner bound than binary networks, and even surpass it. 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 nonlocal 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.
Language: English
Open Access status: hybrid
Estimated APC paid: $3,750
OpenAlex ID: W3045000470
FWCI: 0.533
Cites: 47
Cited by: 12
Related to: 10