paper-with-me

홈 › Papers

Reverse Differentiation via Predictive Coding

2021-03-08 · Tommaso Salvatori, Yuhang Song, Thomas Lukasiewicz, Rafal Bogacz, Zhenghua Xu

Deep learning has redefined the field of artificial intelligence (AI) thanks to the rise of artificial neural networks, which are architectures inspired by their neurological counterpart in the brain. Through the years, this dualism between AI and neuroscience has brought immense benefits to both fields, allowing neural networks to be used in dozens of applications. These networks use an efficient implementation of reverse differentiation, called backpropagation (BP). This algorithm, however, is often criticized for its biological implausibility (e.g., lack of local update rules for the parameters). Therefore, biologically plausible learning methods that rely on predictive coding (PC), a framework for describing information processing in the brain, are increasingly studied. Recent works prove that these methods can approximate BP up to a certain margin on multilayer perceptrons (MLPs), and asymptotically on any other complex model, and that zero-divergence inference learning (Z-IL), a variant of PC, is able to exactly implement BP on MLPs. However, the recent literature shows also that there is no biologically plausible method yet that can exactly replicate the weight update of BP on complex models. To fill this gap, in this paper, we generalize (PC and) Z-IL by directly defining them on computational graphs, and show that it can perform exact reverse differentiation. What results is the first biologically plausible algorithm that is equivalent to BP in the way of updating parameters on any neural network, providing a bridge between the interdisciplinary research of neuroscience and deep learning.

📄 PDF Abstract BibTeX arXiv:2103.04689

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Reverse Faà di Bruno's Formula for Cartesian Reverse Differential Categories

2025-09-25 · Aaron Biggin, Jean-Simon Pacaud Lemay arxiv

Reverse differentiation is an essential operation for automatic differentiation. Cartesian reverse differential categories axiomatize reverse differentiation in a categorical framework, where one of the primary axioms is…

Decomposing reverse-mode automatic differentiation

2021-05-20 · Roy Frostig, Matthew J. Johnson, Dougal Maclaurin, Adam Paszke 외

We decompose reverse-mode automatic differentiation into (forward-mode) linearization followed by transposition. Doing so isolates the essential difference between forward- and reverse-mode AD, and simplifies their joint…

Source-to-Source Automatic Differentiation of OpenMP Parallel Loops

2021-11-02 · Jan Hückelheim, Laurent Hascoët

This paper presents our work toward correct and efficient automatic differentiation of OpenMP parallel worksharing loops in forward and reverse mode. Automatic differentiation is a method to obtain gradients of numerical…

Uncertainty Quantification

Predictive Coding Approximates Backprop along Arbitrary Computation Graphs

2020-06-07 · Beren Millidge, Alexander Tschantz, Christopher L. Buckley

Backpropagation of error (backprop) is a powerful algorithm for training machine learning architectures through end-to-end differentiation. However, backprop is often criticised for lacking biological plausibility. Recen…

BIG-bench Machine Learning

A Differential-form Pullback Programming Language for Higher-order Reverse-mode Automatic Differentiation

2020-02-19 · Carol Mak, Luke Ong

Building on the observation that reverse-mode automatic differentiation (AD) -- a generalisation of backpropagation -- can naturally be expressed as pullbacks of differential 1-forms, we design a simple higher-order prog…

Form