Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2009.08378

Event-Based Backpropagation can compute Exact Gradients for Spiking Neural Networks

Timo C. Wunderlich·Christian Pehle
View original source ↗Read source document ↗Export metadata ↓

Abstract

Spiking neural networks combine analog computation with event-based communication using discrete spikes. While the impressive advances of deep learning are enabled by training non-spiking artificial neural networks using the backpropagation algorithm, applying this algorithm to spiking networks was previously hindered by the existence of discrete spike events and discontinuities. For the first time, this work derives the backpropagation algorithm for a continuous-time spiking neural network and a general loss function by applying the adjoint method together with the proper partial derivative jumps, allowing for backpropagation through discrete spike events without approximations. This algorithm, EventProp, backpropagates errors at spike times in order to compute the exact gradient in an event-based, temporally and spatially sparse fashion. We use gradients computed via EventProp to train networks on the Yin-Yang and MNIST datasets using either a spike time or voltage based loss function and report competitive performance. Our work supports the rigorous study of gradient-based learning algorithms in spiking neural networks and provides insights toward their implementation in novel brain-inspired hardware.

Explore related subjects

q-bio.NCcs.NE

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timo C. Wunderlich, Christian Pehle. 2021-05-31. Event-Based Backpropagation can compute Exact Gradients for Spiking Neural Networks. https://doi.org/10.1038/s41598-021-91786-z

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Identifying Neural State Changes due to Gain versus Off-Manifold Displacement

Memory segmentation is thought to arise from rapid decorrelation in neural activity, often quantified by Euclidean distance or cosine angle. Although these metrics detect a transition, they do not reveal how the new state relates to the repertoire represented by the neural manifold. This matters because neuromodulators that drive state transitions also alter excitability, and learning may repurpose existing representations or create new ones. Here, I introduce a geometric decomposition that separates changes attributable to gain modulation of a nearby manifold state from movement within the manifold and genuine off-manifold displacement. The approach uses the radial axis of neural population activity to partition the normal space of a local manifold region. A central challenge is identifiability: given only a static reference manifold and a single test state, neither the state from which a perturbation began nor its gain magnitude and mechanistic decomposition can generally be recovered uniquely. I therefore formulate identifiability as a cascade of geometric gates specifying when each component can be interpreted. The gates distinguish structural failures, including the absence of a local chart or incorrect intrinsic dimensionality, from estimation error and systematic bias caused by reference sampling, tangent-frame error, gain-axis misalignment, anchor displacement, and poor ratio conditioning. Simulations show that neighborhood size, curvature, sampling density, ambient dimension, and noise act through a small set of geometric quantities. The framework specifies when assignments to gain or novelty are identifiable, how they become biased, and which diagnostics reveal the relevant failure regime. By quantifying the nature rather than only the magnitude of neural state change, it provides a clear, readily interpretable framework for evaluating mechanisms of neural state transitions.

q-bio.NC↗
arXiv2026

Neural Langevin Machine: a local asymmetric learning rule can be creative

Fixed points of recurrent neural networks can be leveraged to store and generate information. These fixed points are captured by the Boltzmann-Gibbs measure, which leads to neural Langevin dynamics that relax to those fixed points for generative learning of a real dataset. We call this type of generative model a neural Langevin machine, which derives an asymmetric and firing-rate-speed-adjusted learning rule requiring only local neural signals, thereby bearing biological relevance in terms of local predictive learning. An out-of-equilibrium regime of the generative process is revealed, together with a memorization-to-generalization transition with increasing training data size. The neuro-inspired machine can also realize a continuous exploration of the phase space for different kinds of generative images and can denoise a corrupted image as well.

q-bio.NC↗
arXiv2026

A Mathematical Model of Motivated Emotional Mind - Cognitive Embodied System

This article presents a mathematical model of the Motivated Emotional Mind cognitive architecture developed for embodied intelligent systems. Such a system learns to maintain its homeostasis through a generalized form of reinforcement learning based on its internal motivations, termed motivated learning (ML). The principal contribution of this article is a rigorous formalization of the re-entrant loop integrating feedforward processing, lateral interactions, and feedback pathways, together with the representational selection mechanisms that govern adaptive system responses. The model specifies how ongoing exteroceptive and interoceptive signals, bodily-motivational context, and memory traces are bound into associative memory structures termed semblions, which compete for access to further processing and top-down reconstruction. The formalization encompasses secondary perception, representational competition, curiosity, procedural gaps, and action selection directed toward limiting allostatic violations. Within this framework, motivated learning is tailored to embodied systems whose dynamics are shaped by needs, affect, and the current regulatory state. Unlike standard reinforcement-learning models, the proposed approach incorporates need thresholds, goal generation and shifting goals, bodily state, resource constraints, and action uncertainty, thereby providing a more adequate account of response selection under regulatory pressure. Global affect functions as a central control signal, modulating the learning rate, representational valence, and the balance between exploration and exploitation. The model presented here is a step toward a more rigorous formalization of cognitive phenomena and may provide a basis for further theoretical analysis, computer simulation, and implementation in artificial-intelligence systems inspired by biological processes.

q-bio.NC↗