Characterizing emergent representations in a space of candidate learning rules for deep networks
Yinan Cao, Christopher Summerfield, Andrew M. Saxe
Abstract
How are sensory representations learned via experience? Deep learning offers a theoretical toolkit for studying how neural codes emerge under different learning rules. Studies suggesting that representations in deep networks resemble those in biological brains have mostly relied on one specific learning rule: gradient descent, the workhorse behind modern deep learning. However, it remains unclear how robust these emergent representations in deep networks are to this specific choice of learning algorithm. Here we present a continuous two-dimensional space of candidate learning rules, parameterized by levels of top-down feedback and Hebbian learning. We show that this space contains five important candidate learning algorithms as specific points-Gradient Descent, Contrastive Hebbian, quasi-Predictive Coding, Hebbian & Anti-Hebbian. Next, we exhaustively characterize the properties of each rule during learning about hierarchically structured data, and identify zones within this space where deep networks exhibit qualitative signatures of biological learning. We find that while a large set of algorithms achieve zero training error at convergence, only a subset show hallmarks of human semantic development like progressive differentiation and illusory correlations. Further, only a subset adjust intermediate neural representations toward task-relevant representations, indicative of backpropagation-like behavior. Finally, we show that algorithms can dramatically differ in their learned neural representations and dynamics, providing experimentally testable hallmarks of different learning principles. Our findings provide a framework linking diverse neural representational geometries to learning principles which can guide future experiments, and offer evidence about the learning rules likely to be at work in biology.
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 367a7409-47a5-406e-bb27-37cf1107800cCited by top-tier papers6
- Credit Assignment Through Broadcasting a Global Error VectorDavid G. Clark, L. F. Abbott, SueYeon ChungNeurIPS 2021 · 29 citations
- Beyond accuracy: generalization properties of bio-plausible temporal credit assignment rulesYuhan Helena Liu, Arna Ghosh, Blake A. Richards, Eric Shea-Brown et al.NeurIPS 2022 · 10 citations
- The Influence of Learning Rule on Representation Dynamics in Wide Neural NetworksBlake Bordelon, Cengiz PehlevanICLR 2023 · 7 citations
- Flexible Phase Dynamics for Bio-Plausible Contrastive LearningEzekiel Williams, Colin Bredenberg, Guillaume LajoieICML 2023 · 7 citations
- On The Specialization of Neural ModulesDevon Jarvis, Richard Klein, Benjamin Rosman, Andrew M. SaxeICLR 2023 · 4 citations
Related papers
- Local plasticity rules can learn deep representations using self-supervised contrastive predictionsBernd Illing, Jean Ventura, Guillaume Bellec, Wulfram GerstnerNeurIPS 2021 · 99 citations
- Identifying Learning Rules From Neural Network ObservablesAran Nayebi, Sanjana Srivastava, Surya Ganguli, Daniel L. K. YaminsNeurIPS 2020 · 27 citations
- A Theoretical Framework for Inference LearningNick Alonso, Beren Millidge, Jeffrey L. Krichmar, Emre O. NeftciNeurIPS 2022 · 24 citations
- HCL-FF: Hierarchical and Contrastive Learning for Forward-Forward AlgorithmJie-En Yao, Hong-En Chen, C.-C. Jay KuoCVPR 2026
- Minimizing Control for Credit Assignment with Strong FeedbackAlexander Meulemans, Matilde Tristany Farinha, Maria R. Cervera, João Sacramento et al.ICML 2022 · 24 citations
