Kernelized information bottleneck leads to biologically plausible 3-factor Hebbian learning in deep networks
Roman Pogodin, Peter E. Latham
Abstract
The state-of-the art machine learning approach to training deep neural networks, backpropagation, is implausible for real neural networks: neurons need to know their outgoing weights; training alternates between a forward pass (computation) and a backward pass (learning); and the algorithm needs a large amount of labeled data. Biologically plausible approximations to backpropagation, such as feedback alignment, solve the weight transport problem, but not the other two. Thus, fully biologically plausible learning rules have so far remained elusive. Here we present a family of learning rules that does not suffer from any of these problems. It is motivated by the information bottleneck principle (extended with kernel methods), in which networks learn to squeeze as much information as possible out of the input without sacrificing prediction of the output. The resulting rules have a 3-factor Hebbian structure: they require pre- and post-synaptic firing rates and a global error signal - the third factor - that can be supplied by a neuromodulator. Moreover, they do not require precise labels; instead, they rely on the similarity between the desired outputs. They thus solve all three implausibility issues of backpropagation. Moreover, to obtain good performance on hard problems and retain biologically plausible learning rules, our rules need divisive normalization - a known feature of biological networks. Finally, simulations show that our rule performs nearly as well as backpropagation on image classification tasks.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext eacbfd7e-6340-4971-81ef-f628e2f10aa7Cited by top-tier papers14
- Self-Supervised Learning with Kernel Dependence MaximizationYazhe Li, Roman Pogodin, Danica J. Sutherland, Arthur GrettonNeurIPS 2021 · 107 citations
- Efficient Knowledge Distillation from Model CheckpointsChaofei Wang, Qisen Yang, Rui Huang, Shiji Song et al.NeurIPS 2022 · 61 citations
- Towards Biologically Plausible Convolutional NetworksRoman Pogodin, Yash Mehta, Timothy P. Lillicrap, Peter E. LathamNeurIPS 2021 · 30 citations
- Automatic Network Pruning via Hilbert-Schmidt Independence Criterion Lasso under Information Bottleneck PrincipleSong Guo, Lei Zhang, Xiawu Zheng, Yan Wang et al.ICCV 2023 · 30 citations
- Credit Assignment Through Broadcasting a Global Error VectorDavid G. Clark, L. F. Abbott, SueYeon ChungNeurIPS 2021 · 29 citations
Builds on2
Related papers
- Error-driven Input Modulation: Solving the Credit Assignment Problem without a Backward PassGiorgia Dellaferrera, Gabriel KreimanICML 2022 · 80 citations
- Hebbian Deep Learning Without FeedbackAdrien Journé, Hector Garcia Rodriguez, Qinghai Guo, Timoleon MoraitisICLR 2023 · 17 citations
- Spike-based causal inference for weight alignmentJordan Guerguiev, Konrad P. Körding, Blake A. RichardsICLR 2020 · 26 citations
- Convergence and Alignment of Gradient Descent with Random Backpropagation WeightsGanlin Song, Ruitu Xu, John LaffertyNeurIPS 2021 · 4 citations
- Two Routes to Scalable Credit Assignment without Weight SymmetryDaniel Kunin, Aran Nayebi, Javier Sagastuy-Breña, Surya Ganguli et al.ICML 2020 · 37 citations
