Biological credit assignment through dynamic inversion of feedforward networks
William F. Podlaski, Christian K. Machens
Abstract
Learning depends on changes in synaptic connections deep inside the brain. In multilayer networks, these changes are triggered by error signals fed back from the output, generally through a stepwise inversion of the feedforward processing steps. The gold standard for this process -- backpropagation -- works well in artificial neural networks, but is biologically implausible. Several recent proposals have emerged to address this problem, but many of these biologically-plausible schemes are based on learning an independent set of feedback connections. This complicates the assignment of errors to each synapse by making it dependent upon a second learning problem, and by fitting inversions rather than guaranteeing them. Here, we show that feedforward network transformations can be effectively inverted through dynamics. We derive this dynamic inversion from the perspective of feedback control, where the forward transformation is reused and dynamically interacts with fixed or random feedback to propagate error signals during the backward pass. Importantly, this scheme does not rely upon a second learning problem for feedback because accurate inversion is guaranteed through the network dynamics. We map these dynamics onto generic feedforward networks, and show that the resulting algorithm performs well on several supervised and unsupervised datasets. We also link this dynamic inversion to Gauss-Newton optimization, suggesting a biologically-plausible approximation to second-order learning. Overall, our work introduces an alternative perspective on credit assignment in the brain, and proposes a special role for temporal dynamics and feedback control during learning.
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 4fe7c586-b82d-4462-8dab-87cf374a1c5bCited by top-tier papers10
- A Theoretical Framework for Target PropagationAlexander Meulemans, Francesco S. Carzaniga, Johan A. K. Suykens, João Sacramento et al.NeurIPS 2020 · 110 citations
- Holomorphic Equilibrium Propagation Computes Exact Gradients Through Finite Size OscillationsAxel Laborieux, Friedemann ZenkeNeurIPS 2022 · 65 citations
- Credit Assignment in Neural Networks through Deep Feedback ControlAlexander Meulemans, Matilde Tristany Farinha, Javier García Ordóñez, Pau Vilimelis Aceituno et al.NeurIPS 2021 · 61 citations
- The least-control principle for local learning at equilibriumAlexander Meulemans, Nicolas Zucchet, Seijin Kobayashi, Johannes von Oswald et al.NeurIPS 2022 · 32 citations
- Minimizing Control for Credit Assignment with Strong FeedbackAlexander Meulemans, Matilde Tristany Farinha, Maria R. Cervera, João Sacramento et al.ICML 2022 · 24 citations
Builds on2
- A Theoretical Framework for Target PropagationAlexander Meulemans, Francesco S. Carzaniga, Johan A. K. Suykens, João Sacramento et al.NeurIPS 2020 · 110 citations
- Learning to solve the credit assignment problemBenjamin James Lansdell, Prashanth Ravi Prakash, Konrad Paul KördingICLR 2020 · 60 citations
Related papers
- Feedback control guides credit assignment in recurrent neural networksKlara Kaleb, Barbara Feulner, Juan Gallego, Claudia ClopathNeurIPS 2024 · 5 citations
- Counter-Current Learning: A Biologically Plausible Dual Network Approach for Deep LearningChia-Hsiang Kao, Bharath HariharanNeurIPS 2024 · 9 citations
- Attention-Gated Brain Propagation: How the brain can implement reward-based error backpropagationIsabella Pozzi, Sander M. Bohté, Pieter R. RoelfsemaNeurIPS 2020 · 38 citations
- Error Forcing in Recurrent Neural NetworksA Erdem Sagtekin, Colin Bredenberg, Cristina SavinNeurIPS 2025 · 5 citations
- Learning to Learn with Feedback and Local PlasticityJack Lindsey, Ashok Litwin-KumarNeurIPS 2020 · 38 citations
