Deep Learning without Weight Transport

04/10/2019
by   Mohamed Akrout, et al.
0

Current algorithms for deep learning probably cannot run in the brain because they rely on weight transport, where forward-path neurons transmit their synaptic weights to a feedback path, in a way that is likely impossible biologically. An algorithm called feedback alignment achieves deep learning without weight transport by using random feedback weights, but it performs poorly on hard visual-recognition tasks. Here we describe two mechanisms - a neural circuit called a weight mirror and a version of an algorithm proposed by Kolen and Pollack in 1994 - both of which let the feedback path learn appropriate synaptic weights quickly and accurately even in large networks, without weight transport or complex wiring. Tested on the ImageNet visual-recognition task, these mechanisms outperform both feedback alignment and the newer sign-symmetry method, and nearly match backprop, the standard algorithm of deep learning, which uses weight transport.

READ FULL TEXT
research
04/10/2019

Using Weight Mirrors to Improve Feedback Alignment

Current algorithms for deep learning probably cannot run in the brain be...
research
12/12/2018

Feedback alignment in deep convolutional networks

Ongoing studies have identified similarities between neural representati...
research
10/03/2019

Spike-based causal inference for weight alignment

In artificial neural networks trained with gradient descent, the weights...
research
06/19/2018

Contrastive Hebbian Learning with Random Feedback Weights

Neural networks are commonly trained to make predictions through learnin...
research
06/23/2020

Direct Feedback Alignment Scales to Modern Deep Learning Tasks and Architectures

Despite being the workhorse of deep learning, the backpropagation algori...
research
12/01/2022

Synaptic Dynamics Realize First-order Adaptive Learning and Weight Symmetry

Gradient-based first-order adaptive optimization methods such as the Ada...
research
01/26/2022

Combining optimal path search with task-dependent learning in a neural network

Finding optimal paths in connected graphs requires determining the small...

Please sign up or login with your details

Forgot password? Click here to reset