REVIEW 3 cited by
Hebbian learning with gradients: Hebbian convolutional neural networks with modern deep learning frameworks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Deep learning networks generally use non-biological learning methods. By contrast, networks based on more biologically plausible learning, such as Hebbian learning, show comparatively poor performance and difficulties of implementation. Here we show that Hebbian learning in hierarchical, convolutional neural networks can be implemented almost trivially with modern deep learning frameworks, by using specific losses whose gradients produce exactly the desired Hebbian updates. We provide expressions whose gradients exactly implement a plain Hebbian rule (dw ~= xy), Grossberg's instar rule (dw ~= y(x-w)), and Oja's rule (dw ~= y(x-yw)). As an application, we build Hebbian convolutional multi-layer networks for object recognition. We observe that higher layers of such networks tend to learn large, simple features (Gabor-like filters and blobs), explaining the previously reported decrease in decoding performance over successive layers. To combat this tendency, we introduce interventions (denser activations with sparse plasticity, pruning of connections between layers) which result in sparser learned features, massively increase performance, and allow information to increase over successive layers. We hypothesize that more advanced techniques (dynamic stimuli, trace learning, feedback connections, etc.), together with the massive computational boost offered by modern deep learning frameworks, could greatly improve the performance and biological relevance of multi-layer Hebbian networks.
Forward citations
Cited by 3 Pith papers
-
Orthogonal Dendritic Intrinsic Networks: An Architecture for Significance-Ordered, Orthogonal Latent Spaces
ODIN recovers ordered, orthogonal latent spaces via dendritic decoding plus an orthogonality penalty, and is provably equivalent to ordered PCA in the linear regime.
-
Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraints
A constrained Hebbian rule produces audiovisual representations with lower task-information cost (retained input information per unit of task-relevant information) than sparse backpropagation and DDTP at comparable ac...
-
OscNet: Machine Learning on CMOS Oscillator Networks
CMOS oscillator networks with phase-encoded values and winner-take-all Hebbian learning can perform convolution, regression, and MNIST classification, per the paper's simulations.
Discussion (0). Continue with ORCID to comment.