A Biologically Plausible Learning Algorithm for Neural Networks

Share this post:

In spite of the great success of deep learning on a range of computationally challenging tasks, questions remain as to the extent of the similarity between the computational properties of deep neural networks and those of the human brain. The particularly nonbiological aspect of deep learning is the supervised training process with a backpropagation algorithm, which requires massive amounts of labeled data, and a nonlocal learning rule for changing the weights. My colleague and I developed a learning algorithm inspired by synaptic plasticity rules conceptually similar to those operating in real biological neural networks. We describe this algorithm in our paper “Unsupervised Learning by Competing Hidden Units” published last week in the journal Proceedings of the National Academies of Science of the United States of America. The proposed algorithm learns the weights of the lower layer of neural networks in a completely unsupervised fashion. These weights are agnostic about the task that the neural network will have to solve eventually in higher layers. In spite of this, they can be used to train a good classifier in the higher layers that is tailored for some specific task. The entire algorithm utilizes local learning rules for updating the weights.

The key idea of the algorithm relies on a network motif with the lateral inhibition between the hidden neurons and a learning rule that is inspired by Hebbian-like plasticity mechanisms known to exist in biology. For every data point, such as an image, the hidden neurons compete with each other so that eventually only a handful of them remain active while the majority fall below the activation threshold. The activities of those active hidden neurons together with the activities of the visible neurons are then used to update the weights. This learning rule utilizes only local information that is directly knowable by the two neurons that are connected by a given weight. The growth of the weights as the training progresses is shown in the video below.

The paper compares the performance of two networks. The first one is trained using the two-stage procedure: the proposed “biological” training of the first layer followed by the standard gradient descent training of the classifier in the top layer. The second one is trained end-to-end with the backpropagation algorithm on a supervised task. In our paper we investigate the proposed “biological” algorithm in the framework of fully connected neural networks with one hidden layer on the pixel permutation invariant MNIST and CIFAR-10 datasets.

In the case of MNIST, the weights of the hidden layer together with the errors on the training and the test sets for the two networks are shown in the figure below. The network that is trained with the backpropagation algorithm end-to-end demonstrates the well-known benchmarks: training error = 0%, test error = 1.5%. The network trained in a “biological” way reaches the error on the training set 0.4%. Thus, it never fits the training data perfectly. At the same time, the error on the held-out test set is 1.46%, the same as the error of the network that is trained end-to-end. This is surprising because the proposed “biological” algorithm learned the weights of the first layer without knowing what task these weights will be used for, unlike the network that is trained end-to-end. Also, the “biological” algorithm was constrained by the requirement to utilize only local plasticity rules for learning those weights.

Another interesting aspect is that the weights of the proposed “biological” algorithm (left panel) are very different from the weights learned by the backpropagation algorithm (middle panel). At the same time, they are not just copies of the individual training examples, and encode both the presence (red color) and the absence (blue color) of ink in the MNIST images. The full “biological” network learns a distributed representation of the training data over multiple hidden units.

A similar comparison was done on CIFAR-10 dataset. In this case the accuracy of our “biological” algorithm is slightly worse than that of the network trained end-to-end. However, it still demonstrates a good performance.

Learn more details by reading the full paper or watching a video lecture discussing the results. You can also download the code used for the “biological” training.

Research Staff Member, IBM Research

More Publications stories

IBM Research and The Michael J. Fox Foundation Develop Modeling Methodology to Help Understand Parkinson’s Disease Using Machine Learning

In collaboration with The Michael J. Fox Foundation for Parkinson’s Research, our team of researchers at IBM is aiming to develop improved disease progression models that can help clinicians understand how the disease progresses in relation to the emergence of symptoms, even when those patients are taking symptom-modifying medications.

Continue reading

AI Could Help Enable Accurate Remote Monitoring of Parkinson’s Patients

In a paper recently published in Nature Scientific Reports, IBM Research and scientists from several other medical institutions developed a new way to estimate the severity of a person’s Parkinson’s disease (PD) symptoms by remotely measuring and analyzing physical activity as motor impairment increased. Using data captured by wrist-worn accelerometers, we created statistical representations of […]

Continue reading

IBM Supports Q2Work Education Initiative

The need for a future workforce with a robust set of quantum computing skills drives our support for Q2Work, the National Science Foundation-funded initiative led by the University of Illinois and the University of Chicago to provide quantum education, programs, tools, and curricula to K-12 students.

Continue reading