paper-with-me

Papers

Localized random projections challenge benchmarks for bio-plausible deep learning

2019-05-01 · ICLR 2019 5 · Bernd Illing, Wulfram Gerstner, Johanni Brea

Similar to models of brain-like computation, artificial deep neural networks rely on distributed coding, parallel processing and plastic synaptic weights. Training deep neural networks with the error-backpropagation algorithm, however, is considered bio-implausible. An appealing alternative to training deep neural networks is to use one or a few hidden layers with fixed random weights or trained with an unsupervised, local learning rule and train a single readout layer with a supervised, local learning rule. We find that a network of leaky-integrate-andfire neurons with fixed random, localized receptive fields in the hidden layer and spike timing dependent plasticity to train the readout layer achieves 98.1% test accuracy on MNIST, which is close to the optimal result achievable with error-backpropagation in non-convolutional networks of rate neurons with one hidden layer. To support the design choices of the spiking network, we systematically compare the classification performance of rate networks with a single hidden layer, where the weights of this layer are either random and fixed, trained with unsupervised Principal Component Analysis or Sparse Coding, or trained with the backpropagation algorithm. This comparison revealed, first, that unsupervised learning does not lead to better performance than fixed random projections for large hidden layers on digit classification (MNIST) and object recognition (CIFAR10); second, networks with random projections and localized receptive fields perform significantly better than networks with all-to-all connectivity and almost reach the performance of networks trained with the backpropagation algorithm. The performance of these simple random projection networks is comparable to most current models of bio-plausible deep learning and thus provides an interesting benchmark for future approaches.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Deep LearningGeneral ClassificationObject Recognition

Similar Papers 제목 키워드 기반

Biologically plausible deep learning -- but how far can we go with shallow networks?

2019-02-27 · Bernd Illing, Wulfram Gerstner, Johanni Brea

Training deep neural networks with the error backpropagation algorithm is considered implausible from a biological perspective. Numerous recent publications suggest elaborate models for biologically plausible variants of…

Meta-Learning Biologically Plausible Plasticity Rules with Random Feedback Pathways

2022-10-28 · Navid Shervani-Tabar, Robert Rosenbaum

Backpropagation is widely used to train artificial neural networks, but its relationship to synaptic plasticity in the brain is unknown. Some biological models of backpropagation rely on feedback projections that are sym…

Meta-Learning

Dendritic Localized Learning: Toward Biologically Plausible Algorithm

2025-01-17 · Changze Lv, Jingwen Xu, Yiyang Lu, Xiaohua Wang 외

Backpropagation is the foundational algorithm for training neural networks and a key driver of deep learning's success. However, its biological plausibility has been challenged due to three primary limitations: weight sy…

Learning efficient backprojections across cortical hierarchies in real time

2022-12-20 · Kevin Max, Laura Kriener, Garibaldi Pineda García, Thomas Nowotny 외

Models of sensory processing and learning in the cortex need to efficiently assign credit to synapses in all areas. In deep learning, a known solution is error backpropagation, which however requires biologically implaus…

Tight Variational Bounds via Random Projections and I-Projections

2015-10-05 · Lun-Kai Hsu, Tudor Achim, Stefano Ermon

Information projections are the key building block of variational inference algorithms and are used to approximate a target probabilistic model by projecting it onto a family of tractable distributions. In general, there…

Variational Inference