mlsanityData to 13 Oct 2026

Biologically Plausible Training Mechanisms for Self-Supervised Learning in Deep Networks

arXiv 2109.15089 ↗First posted 30 Sep 2021cs.NE cs.LG q-bio.NCcited by 6

Not on the map. Why?

Abstract (arXiv)

We develop biologically plausible training mechanisms for self-supervised learning (SSL) in deep networks. Specifically, by biological plausible training we mean (i) All updates of weights are based on current activities of pre-synaptic units and current, or activity retrieved from short term memory of post synaptic units, including at the top-most error computing layer, (ii) Complex computations such as normalization, inner products and division are avoided (iii) Asymmetric connections between units, (iv) Most learning is carried out in an unsupervised manner. SSL with a contrastive loss satisfies the third condition as it does not require labelled data and it introduces robustness to observed perturbations of objects, which occur naturally as objects or observer move in 3d and with variable lighting over time. We propose a contrastive hinge based loss whose error involves simple local computations satisfying (ii), as opposed to the standard contrastive losses employed in the literature, which do not lend themselves easily to implementation in a network architecture due to complex computations involving ratios and inner products. Furthermore we show that learning can be performed with one of two more plausible alternatives to backpropagation that satisfy conditions (i) and (ii). The first is difference target propagation (DTP) and the second is layer-wise learning (LL), where each layer is directly connected to a layer computing the loss error. Both methods represent alternatives to the symmetric weight issue of backpropagation. By training convolutional neural networks (CNNs) with SSL and DTP, LL, we find that our proposed framework achieves comparable performance to standard BP learning downstream linear classifier evaluation of the learned embeddings.

Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). Builds on 24 of its 56 references that are in the map. First posted on arXiv 30 Sep 2021.

Builds on

24 of 56 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,093
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,321
  3. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,009
  4. 2018Representation Learning with Contrastive Predictive Codingcited by 7,712
  5. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,492
  6. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,730
  7. 2020Exploring Simple Siamese Representation Learningcited by 2,860
  8. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,850
  9. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,826
  10. 2019Data-Efficient Image Recognition with Contrastive Predictive Codingcited by 673
  11. 2021Understanding self-supervised Learning Dynamics without Contrastive Pairscited by 255
  12. 2014Difference Target Propagationcited by 146
12 more
  1. 2016Decoupled Neural Interfaces using Synthetic Gradientscited by 136
  2. 2019Training Neural Networks with Local Error Signalscited by 135
  3. 2018Greedy Layerwise Learning Can Scale to ImageNetcited by 114
  4. 2018Assessing the Scalability of Biologically-Motivated Deep Learning Algorithms and Architecturescited by 101
  5. 2019Deep Learning without Weight Transportcited by 87
  6. 2019Putting An End to End-to-End: Gradient-Isolated Learning of Representationscited by 86
  7. 2015How Important is Weight Symmetry in Backpropagation?cited by 57
  8. 2020A Theoretical Framework for Target Propagationcited by 57
  9. 2020Local plasticity rules can learn deep representations using self-supervised contrastive predictionscited by 47
  10. 2017Deep Learning Models of the Retinal Response to Natural Scenescited by 36
  11. 2017Learning Deep ResNet Blocks Sequentially using Boosting Theorycited by 32
  12. 2018Deep learning with asymmetric connections and Hebbian updatescited by 16

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 2; 2025: 2.

6 papers.