mlsanityData to 14 Oct 2026

Learning efficient backprojections across cortical hierarchies in real time

arXiv 2212.10249 ↗First posted 20 Dec 2022q-bio.NC cs.LG cs.NEcited by 8

Not on the map. Why?

Abstract (arXiv)

Models of sensory processing and learning in the cortex need to efficiently assign credit to synapses in all areas. In deep learning, a known solution is error backpropagation, which however requires biologically implausible weight transport from feed-forward to feedback paths. We introduce Phaseless Alignment Learning (PAL), a bio-plausible method to learn efficient feedback weights in layered cortical hierarchies. This is achieved by exploiting the noise naturally found in biophysical systems as an additional carrier of information. In our dynamical system, all weights are learned simultaneously with always-on plasticity and using only information locally available to the synapses. Our method is completely phase-free (no forward and backward passes or phased learning) and allows for efficient error propagation across multi-layer cortical hierarchies, while maintaining biologically plausible signal transport and learning. Our method is applicable to a wide class of models and improves on previously known biologically plausible ways of credit assignment: compared to random synaptic feedback, it can solve complex tasks with less neurons and learn more useful latent representations. We demonstrate this on various classification tasks using a cortical microcircuit model with prospective coding.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 26 of its 82 references that are in the map. First posted on arXiv 20 Dec 2022.

Builds on

26 of 82 references.

References · 26

  1. 2016Equilibrium Propagation: Bridging the Gap Between Energy-Based Models and Backpropagationcited by 259
  2. 2016Direct Feedback Alignment Provides Learning in Deep Neural Networkscited by 240
  3. 2014Difference Target Propagationcited by 148
  4. 2018Assessing the Scalability of Biologically-Motivated Deep Learning Algorithms and Architecturescited by 101
  5. 2018Dendritic cortical microcircuits approximate the backpropagation algorithmcited by 97
  6. 2019Deep Learning without Weight Transportcited by 87
  7. 2014How Auto-Encoders Could Provide Credit Assignment in Deep Networks via Target Propagationcited by 79
  8. 2016Towards an integration of deep learning and neurosciencecited by 78
  9. 2016Towards deep learning with segregated dendritescited by 71
  10. 2018Eligibility Traces and Plasticity on Behavioral Time Scales: Experimental Support of neoHebbian Three-Factor Learning Rulescited by 67
  11. 2020A Theoretical Framework for Target Propagationcited by 57
  12. 2014Random feedback weights support learning in deep neural networkscited by 47
14 more
  1. 2022Towards Scaling Difference Target Propagation by Learning Backprop Targetscited by 34
  2. 2018Feedback alignment in deep convolutional networkscited by 31
  3. 2021Credit Assignment in Neural Networks through Deep Feedback Controlcited by 29
  4. 2019Learning to solve the credit assignment problemcited by 27
  5. 2019Direct Feedback Alignment with Sparse Connections for Local Learningcited by 26
  6. 2022Single-phase deep learning in cortico-cortical networkscited by 19
  7. 2021Latent Equilibrium: A unified learning theory for arbitrarily fast computation with arbitrarily slow neuronscited by 15
  8. 2015Early Inference in Energy-Based Models Approximates Back-Propagationcited by 13
  9. 2020Biological credit assignment through dynamic inversion of feedforward networkscited by 11
  10. 2021The Yin-Yang datasetcited by 10
  11. 2018A Biologically Plausible Learning Rule for Deep Learning in the Braincited by 9
  12. 2016Stochastic inference with spiking neurons in the high-conductance statecited by 6
  13. 2017Cortical microcircuits as gated-recurrent neural networkscited by 6
  14. 2019Ghost Units Yield Biologically Plausible Backprop in Deep Neural Networkscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 1; 2026: 2.

8 papers.