Biologically-plausible backpropagation through arbitrary timespans via local neuromodulators
Not on the map. Why?
Abstract (arXiv)
The spectacular successes of recurrent neural network models where key parameters are adjusted via backpropagation-based gradient descent have inspired much thought as to how biological neuronal networks might solve the corresponding synaptic credit assignment problem. There is so far little agreement, however, as to how biological networks could implement the necessary backpropagation through time, given widely recognized constraints of biological synaptic network signaling architectures. Here, we propose that extra-synaptic diffusion of local neuromodulators such as neuropeptides may afford an effective mode of backpropagation lying within the bounds of biological plausibility. Going beyond existing temporal truncation-based gradient approximations, our approximate gradient-based update rule, ModProp, propagates credit information through arbitrary time steps. ModProp suggests that modulatory signals can act on receiving cells by convolving their eligibility traces via causal, time-invariant and synapse-type-specific filter taps. Our mathematical analysis of ModProp learning, together with simulation results on benchmark temporal tasks, demonstrate the advantage of ModProp over existing biologically-plausible temporal credit assignment rules. These results suggest a potential neuronal mechanism for signaling credit information related to recurrent interactions over a longer time horizon. Finally, we derive an in-silico implementation of ModProp that could serve as a low-complexity and causal alternative to backpropagation through time.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Jun 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 4; 2024: 0; 2025: 2; 2026: 1.
7 papers.
- 2023Brain-inspired learning in artificial neural networks: a reviewcited by 26
- 2023How connectivity structure shapes rich and lazy learning in neural circuitscited by 15
- 2023SparseProp: Efficient Event-Based Simulation and Training of Sparse Recurrent Spiking Neural Networkscited by 6
- 2023A Neuro-mimetic Realization of the Common Model of Cognition via Hebbian Learning and Free Energy Minimizationcited by 2
- 2025Can Biologically Plausible Temporal Credit Assignment Rules Match BPTT for Neural Similarity? E-prop as an Examplecited by 1
- 2026CATFormer: When Continual Learning Meets Spiking Transformers With Dynamic Thresholdscited by 1
- 2025Flexible inference for animal learning rules using neural networkscited by 0
- 2026CATFormer: When Continual Learning Meets Spiking Transformers With Dynamic Thresholds16 Mar 2026
- 2025Flexible inference for animal learning rules using neural networks4 Sep 2025
- 2025Can Biologically Plausible Temporal Credit Assignment Rules Match BPTT for Neural Similarity? E-prop as an Example7 Jun 2025
- 2023SparseProp: Efficient Event-Based Simulation and Training of Sparse Recurrent Spiking Neural Networks28 Dec 2023
- 2023A Neuro-mimetic Realization of the Common Model of Cognition via Hebbian Learning and Free Energy Minimization14 Oct 2023
- 2023How connectivity structure shapes rich and lazy learning in neural circuits12 Oct 2023
- 2023Brain-inspired learning in artificial neural networks: a review18 May 2023