Local Synaptic Rules Can Implement a SIGReg Gradient Without Backpropagation

• URL: http://arxiv.org/abs/2607.21622v1
• Date: Fri, 03 Jul 2026 19:05:26 GMT
• Title: Local Synaptic Rules Can Implement a SIGReg Gradient Without Backpropagation
• Abstract summary: We prove that two canonical local synaptic learning rules, the potentiation arm of spike-timing-dependent plasticity (STDP$+$) and homeostatic plasticity (STDP$+$) together can implement the exact gradient of a SIGReg-like self-supervised learning objective.<n>The equivalence requires no gradient calculations, no global error signals, no weight transport, and no label information.<n>On temporally ordered MNIST, a two-layer network trained entirely with these rules achieved 87.3% linear-probe accuracy, showing that the mechanism functions end-to-end.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We prove that two canonical local synaptic learning rules, the potentiation arm of spike-timing-dependent plasticity (STDP$^+$) and homeostatic plasticity (instantiated here via flashlight granule-cell-like neurons), together can implement the exact gradient of a SIGReg-like self-supervised learning objective. The equivalence requires no gradient calculations, no global error signals, no weight transport, and no label information: the only inputs are pre- and post-synaptic firing rates, local firing statistics, and the temporal contiguity of natural sensory streams. On a synthetic clustering task designed to probe whether class structure can be recovered from temporal ordering of inputs alone, ordered presentation raised cluster separation (CSR) to 2.49 while random ordering left it near baseline (0.83), a roughly threefold ($\approx 3.5σ$) separation attributable solely to input ordering. On temporally ordered MNIST, a two-layer network trained entirely with these rules achieved 87.3% linear-probe accuracy, showing that the mechanism functions end-to-end.

Related papers

• Linearized PINN with pretrained nonlinear layers [48.01541150431857]
  lPINN is a reduced-order neural basis method for forward and inverse differential equations.<n>We evaluate lPINN on forward and inverse problems for the advection-diffusion equation, Burgers' equation, and the nonlinear pendulum equation.
  arXiv  Detail & Related papers  (2026-09-14T02:18:00Z)
• SeGDeP: Semantic- and Geometric-Aware Decoupled Prompts for Reasoning Segmentation [51.46828526392219]
  Reasoning segmentation converts an implicit linguistic conclusion into a precise mask.<n>Existing MLLM-segmenter interfaces either use a special trigger or compress both signals into one context.<n>We present SeGDeP, an explicit what-where interface.
  arXiv  Detail & Related papers  (2026-09-08T15:11:32Z)
• Propensity Straight-Through Gradients for Discrete Stochastic Systems [0.0]
  We exploit the affine state update to obtain the exact one-step conditional-mean sensitivity.<n>We show that one-step sensitivities composed across events can depart from the exact multistep sensitivity.
  arXiv  Detail & Related papers  (2026-08-26T10:59:25Z)
• Physics from Video: Identifiability of Time-Invariant Second-Order ODEs under Minimal Trajectory Conditions [60.2784641643737]
  Bridging the gap between visual realism and physical understanding is a core challenge for video-based world models.<n>We study the structural identifiability of continuous-time physical laws from raw pixels.<n>We prove that a level-set slope-coverage condition ensures the learned latent space is locally affine to the true physical state.
  arXiv  Detail & Related papers  (2026-05-27T13:22:29Z)
• Monitoring Neural Training with Topology: A Footprint-Predictable Collapse Index [51.56484100374058]
  We propose an online, topology-aware monitor for evolving neural representations that couples Modular Morse Homology Maintenance (MMHM) with a composite Collapse Index (CI)<n>Instead of rebuilding complexes each epoch, we apply sparse edits at a fixed scale and maintain a discrete Morse matching, yielding fast, incremental updates.
  arXiv  Detail & Related papers  (2026-04-28T19:21:21Z)
• Towards Causally Interpretable Wi-Fi CSI-Based Human Activity Recognition with Discrete Latent Compression and LTL Rule Extraction [10.0678616164414]
  We address Human Activity Recognition (HAR) utilizing Wi-Fi Channel State Information (CSI)<n>Deep neural models achieve strong predictive performance on CSI-based HAR (CHAR)<n>We propose a fully automatic and strictly decoupled pipeline in which CSI magnitude windows are compressed by a categorical variational autoencoder.
  arXiv  Detail & Related papers  (2026-04-24T19:45:49Z)
• Relaxation-Informed Training of Neural Network Surrogate Models [3.9722979176564763]
  ReLU neural networks trained surrogate models can be embedded exactly in mixed-integer linear programs (MILPs)<n>The tractability of the resulting MILP depends on structural properties of the network.<n>We show that the proposed regularizers can reduce MILP times by up to four orders of magnitude to an unregularized baseline.
  arXiv  Detail & Related papers  (2026-04-24T17:46:55Z)
• Zero-Shot Detection of Elastic Transient Morphology Across Physical Systems [0.0]
  We show that a representation learned from interferometric strain transients can act as a morphology-sensitive operator for unseen sensors.<n>Using a neural encoder trained exclusively on non-Gaussian instrumental glitches, we perform strict zero-shot anomaly analysis on rolling-element bearings.
  arXiv  Detail & Related papers  (2026-01-16T16:35:07Z)
• DiffeoMorph: Learning to Morph 3D Shapes Using Differentiable Agent-Based Simulations [2.174820084855635]
  DiffeoMorph is an end-to-end differentiable framework for learning a morphogenesis protocol.<n>It guides a population of agents to morph into a target 3D shape.<n>We show that DiffeoMorph can form a range of shapes using only minimal cues.
  arXiv  Detail & Related papers  (2025-12-18T23:50:42Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Growing Steerable Neural Cellular Automata [63.91346650159648]
  In the original implementation of Neural Cellular Automata, cells are incapable of adjusting their own orientation. We make each cell responsible for its own orientation by allowing it to "turn" as determined by an adjustable internal state. We show that we can train Steerable NCA in similar but simpler ways than their Isotropic variant by: (1) breaking symmetries using only two seeds, or (2) introducing a rotation-invariant training objective.
  arXiv  Detail & Related papers  (2023-02-19T09:45:46Z)
• RankSim: Ranking Similarity Regularization for Deep Imbalanced Regression [48.58405556678924]
  RankSim encodes an inductive bias that samples closer in label space should also be closer in feature space. RankSim is complementary to conventional imbalanced learning techniques.
  arXiv  Detail & Related papers  (2022-05-30T16:51:25Z)
• Biologically Plausible Training Mechanisms for Self-Supervised Learning in Deep Networks [14.685237010856953]
  We develop biologically plausible training mechanisms for self-supervised learning (SSL) in deep networks. We show that learning can be performed with one of two more plausible alternatives to backpagation.
  arXiv  Detail & Related papers  (2021-09-30T12:56:57Z)

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.