Exact Gradient Computation for Spiking Neural Networks

Jane Lee, Saeid Haghighatshoar, Amin Karbasi

Keywords: first order methods, neuromorphic computing, spiking neural networks

TL;DR: We offer a proof that shows exact gradients can be computed for spiking neural networks and propose a novel algorithm to compute them, which interestingly contrasts with usual backpropagation.

Abstract: Spiking neural networks (SNNs) have recently emerged as an alternative to traditional neural networks, holding promise for energy efficiency benefits. However, the classic backpropagation algorithm for training traditional networks has been notoriously difficult to apply to SNNs due to the hard-thresholding and discontinuities at spike times. Therefore, a large majority of prior work believes that exact gradients for SNN w.r.t. their weights do not exist and has focused on approximation methods to produce surrogate gradients. In this paper, (1)\,by applying the implicit function theorem to SNN at the discrete spike times, we prove that, albeit being non-differentiable in time, SNNs have well-defined gradients w.r.t. their weights, and (2)\,we propose a novel training algorithm, called \emph{forward propagation} (FP), that computes exact gradients for SNNs. Our derivation of FP in this paper provides insights on why other related algorithms such as Hebbian learning and also recently-proposed surrogate gradient methods may perform well.