Delays in Spiking Neural Networks: A State Space Model Approach
Sanja Karilanova, Subhrakanti Dey, Ayça Özçelikkale
TL;DR
This work presents a principled state-space delay mechanism for spiking neural networks, enabling neurons to access a finite history of inputs through an auxiliary memory state while remaining compatible with common neuron models like LIF and adLIF. By integrating a time-shift state transition and a delay-coupling term, the framework provides a differentiable, architecture-friendly means to inject temporal memory, with careful analysis of delay order, delay-parameter settings, and training overhead. Empirical evaluation on the SHD dataset shows competitive accuracy with existing delay-based SNN approaches, with notable gains in small networks and modest increases in training time and parameter count. The study highlights the practical viability of hardware-friendly delayed SNNs and points to richer neuron models and hardware implementations as promising directions for future work.
Abstract
Spiking neural networks (SNNs) are biologically inspired, event-driven models that are suitable for processing temporal data and offer energy-efficient computation when implemented on neuromorphic hardware. In SNNs, richer neuronal dynamic allows capturing more complex temporal dependencies, with delays playing a crucial role by allowing past inputs to directly influence present spiking behavior. We propose a general framework for incorporating delays into SNNs through additional state variables. The proposed mechanism enables each neuron to access a finite temporal input history. The framework is agnostic to neuron models and hence can be seamlessly integrated into standard spiking neuron models such as LIF and adLIF. We analyze how the duration of the delays and the learnable parameters associated with them affect the performance. We investigate the trade-offs in the network architecture due to additional state variables introduced by the delay mechanism. Experiments on the Spiking Heidelberg Digits (SHD) dataset show that the proposed mechanism matches the performance of existing delay-based SNNs while remaining computationally efficient. Moreover, the results illustrate that the incorporation of delays may substantially improve performance in smaller networks.
