Can Biologically Plausible Temporal Credit Assignment Rules Match BPTT for Neural Similarity? E-prop as an Example

Yuhan Helena Liu, Guangyu Robert Yang, Christopher J. Cueva
2/14/2026

No official code found. Best implementation: Helena-Yuhan-Liu/LearningRuleSimilarities (4 stars, last commit 2025-07-07).

Abstract

Understanding how the brain learns may be informed by studying biologically plausible learning rules. These rules, often approximating gradient descent learning to respect biological constraints such as locality, must meet two critical criteria to be considered an appropriate brain model: (1) good neuroscience task performance and (2) alignment with neural recordings. While extensive research has assessed the first criterion, the second remains underexamined. Employing methods such as Procrustes analysis on well-known neuroscience datasets, this study demonstrates the existence of a biologically plausible learning rule -- namely e-prop, which is based on gradient truncation and has demonstrated versatility across a wide range of tasks -- that can achieve neural data similarity comparable to Backpropagation Through Time (BPTT) when matched for task accuracy. Our findings also reveal that model architecture and initial conditions can play a more significant role in determining neural similarity than the specific learning rule. Furthermore, we observe that BPTT-trained models and their biologically plausible counterparts exhibit similar dynamical properties at comparable accuracies. These results underscore the substantial progress made in developing biologically plausible learning rules, highlighting their potential to achieve both competitive task performance and neural data similarity.

View on arXivView PDF

Code Implementations(1)

40MATLAB, PythonSep 4, 20241 years ago

Similar Papers

Cite this paper

@article{liu2026biologically,
  title  = {Can Biologically Plausible Temporal Credit Assignment Rules Match BPTT for Neural Similarity? E-prop as an Example},
  author = {Yuhan Helena Liu and Guangyu Robert Yang and Christopher J. Cueva},
  year   = {2026},
  eprint = {2506.06904},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2506.06904},
  journal = {ICML 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.06904.svg)](https://codeofpaper.com/paper/2506.06904)

Discussion