Smooth Exact Gradient Descent Learning in Spiking Neural Networks
Christian Klos, Raoul-Martin Memmesheimer
TL;DR
This work advances gradient-based learning for spiking neural networks by introducing exact gradient descent that operates on continuously evolving spiking dynamics. It introduces pseudospikes to propagate learning signals beyond trial ends and develops two pseudospike schemes within QIF and informally comparable LIF frameworks, enabling smooth spike-time optimization and spike-addition/removal. The analysis proves that spike times depend smoothly on initial conditions, input weights, and input spike times, and that gradient continuity is maintained even as spike orders change. The approach is demonstrated on recurrent and deep networks, including MNIST-style tasks, showing precise control over spike timings and promising applications for neuromorphic training with exact gradients.
Abstract
Gradient descent prevails in artificial neural network training, but seems inept for spiking neural networks as small parameter changes can cause sudden, disruptive (dis-)appearances of spikes. Here, we demonstrate exact gradient descent based on continuously changing spiking dynamics. These are generated by neuron models whose spikes vanish and appear at the end of a trial, where it cannot influence subsequent dynamics. This also enables gradient-based spike addition and removal. We illustrate our scheme with various tasks and setups, including recurrent and deep, initially silent networks.
