Learning efficient backprojections across cortical hierarchies in real time

• URL: http://arxiv.org/abs/2212.10249v2
• Date: Fri, 2 Feb 2024 12:29:07 GMT
• Title: Learning efficient backprojections across cortical hierarchies in real time
• Authors: Kevin Max, Laura Kriener, Garibaldi Pineda Garc\'ia, Thomas Nowotny, Ismael Jaras, Walter Senn, Mihai A. Petrovici
• Abstract summary: We introduce a bio-plausible method to learn efficient feedback weights in layered cortical hierarchies. All weights are learned simultaneously with always-on plasticity and using only information locally available to the synapses. Our method is applicable to a wide class of models and improves on previously known biologically plausible ways of credit assignment.
• Score: 1.6474865533365743
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 implausible weight transport from feed-forward to feedback paths. We introduce Phaseless Alignment Learning (PAL), a bio-plausible method to learn efficient feedback weights in layered cortical hierarchies. This is achieved by exploiting the noise naturally found in biophysical systems as an additional carrier of information. In our dynamical system, all weights are learned simultaneously with always-on plasticity and using only information locally available to the synapses. Our method is completely phase-free (no forward and backward passes or phased learning) and allows for efficient error propagation across multi-layer cortical hierarchies, while maintaining biologically plausible signal transport and learning. Our method is applicable to a wide class of models and improves on previously known biologically plausible ways of credit assignment: compared to random synaptic feedback, it can solve complex tasks with less neurons and learn more useful latent representations. We demonstrate this on various classification tasks using a cortical microcircuit model with prospective coding.

Related papers

• The Predictive Forward-Forward Algorithm [79.07468367923619]
  We propose the predictive forward-forward (PFF) algorithm for conducting credit assignment in neural systems. We design a novel, dynamic recurrent neural system that learns a directed generative circuit jointly and simultaneously with a representation circuit. PFF efficiently learns to propagate learning signals and updates synapses with forward passes only.
  arXiv  Detail & Related papers  (2023-01-04T05:34:48Z)
• Single-phase deep learning in cortico-cortical networks [1.7249361224827535]
  We introduce a new model, bursting cortico-cortical networks (BurstCCN), which integrates bursting activity, short-term plasticity and dendrite-targeting interneurons. Our results suggest that cortical features across sub-cellular, cellular, microcircuit and systems levels jointly single-phase efficient deep learning in the brain.
  arXiv  Detail & Related papers  (2022-06-23T15:10:57Z)
• Minimizing Control for Credit Assignment with Strong Feedback [65.59995261310529]
  Current methods for gradient-based credit assignment in deep neural networks need infinitesimally small feedback signals. We combine strong feedback influences on neural activity with gradient-based learning and show that this naturally leads to a novel view on neural network optimization. We show that the use of strong feedback in DFC allows learning forward and feedback connections simultaneously, using a learning rule fully local in space and time.
  arXiv  Detail & Related papers  (2022-04-14T22:06:21Z)
• Neurosymbolic hybrid approach to driver collision warning [64.02492460600905]
  There are two main algorithmic approaches to autonomous driving systems. Deep learning alone has achieved state-of-the-art results in many areas. But sometimes it can be very difficult to debug if the deep learning model doesn't work.
  arXiv  Detail & Related papers  (2022-03-28T20:29:50Z)
• Sign and Relevance Learning [0.0]
  Standard models of biologically realistic reinforcement learning employ a global error signal, which implies the use of shallow networks. In this study, we introduce a novel network that solves this problem by propagating only the sign of the plasticity change. Neuromodulation can be understood as a rectified error or relevance signal, while the top-down sign of the error signal determines whether long-term depression will occur.
  arXiv  Detail & Related papers  (2021-10-14T11:57:57Z)
• Credit Assignment in Neural Networks through Deep Feedback Control [59.14935871979047]
  Deep Feedback Control (DFC) is a new learning method that uses a feedback controller to drive a deep neural network to match a desired output target and whose control signal can be used for credit assignment. The resulting learning rule is fully local in space and time and approximates Gauss-Newton optimization for a wide range of connectivity patterns. To further underline its biological plausibility, we relate DFC to a multi-compartment model of cortical pyramidal neurons with a local voltage-dependent synaptic plasticity rule, consistent with recent theories of dendritic processing.
  arXiv  Detail & Related papers  (2021-06-15T05:30:17Z)
• A More Biologically Plausible Local Learning Rule for ANNs [6.85316573653194]
  The proposed learning rule is derived from the concepts of spike timing dependant plasticity and neuronal association. A preliminary evaluation done on the binary classification of MNIST and IRIS datasets shows comparable performance with backpropagation. The local nature of learning gives a possibility of large scale distributed and parallel learning in the network.
  arXiv  Detail & Related papers  (2020-11-24T10:35:47Z)
• Meta-Learning through Hebbian Plasticity in Random Networks [12.433600693422235]
  Lifelong learning and adaptability are two defining aspects of biological agents. Inspired by this biological mechanism, we propose a search method that only searches for synapse-specific Hebbian learning rules. We find that starting from completely random weights, the discovered Hebbian rules enable an agent to navigate a dynamical 2D-pixel environment.
  arXiv  Detail & Related papers  (2020-07-06T14:32:31Z)
• A Trainable Optimal Transport Embedding for Feature Aggregation and its Relationship to Attention [96.77554122595578]
  We introduce a parametrized representation of fixed size, which embeds and then aggregates elements from a given input set according to the optimal transport plan between the set and a trainable reference. Our approach scales to large datasets and allows end-to-end training of the reference, while also providing a simple unsupervised learning mechanism with small computational cost.
  arXiv  Detail & Related papers  (2020-06-22T08:35:58Z)
• Learning to Learn with Feedback and Local Plasticity [9.51828574518325]
  We employ meta-learning to discover networks that learn using feedback connections and local, biologically inspired learning rules. Our experiments show that meta-trained networks effectively use feedback connections to perform online credit assignment in multi-layer architectures.
  arXiv  Detail & Related papers  (2020-06-16T22:49:07Z)
• Towards Efficient Processing and Learning with Spikes: New Approaches for Multi-Spike Learning [59.249322621035056]
  We propose two new multi-spike learning rules which demonstrate better performance over other baselines on various tasks. In the feature detection task, we re-examine the ability of unsupervised STDP with its limitations being presented. Our proposed learning rules can reliably solve the task over a wide range of conditions without specific constraints being applied.
  arXiv  Detail & Related papers  (2020-05-02T06:41:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.