Optimising Event-Driven Spiking Neural Network with Regularisation and Cutoff
Dengyu Wu, Gaojie Jin, Han Yu, Xinping Yi, Xiaowei Huang

TL;DR
This paper introduces a cutoff-based approach with regularisation techniques to optimize event-driven spiking neural networks, significantly reducing inference time while maintaining accuracy across various datasets.
Contribution
It proposes novel Top-K cutoff and regularisation methods to enable dynamic inference in SNNs, improving efficiency and reducing latency.
Findings
Achieved 1.76 to 2.76x fewer timesteps on CIFAR-10
Achieved 1.64 to 1.95x fewer timesteps on event-based datasets
Maintained near-zero accuracy loss with improved inference efficiency
Abstract
Spiking neural network (SNN), as the next generation of artificial neural network (ANN), offer a closer mimicry of natural neural networks and hold promise for significant improvements in computational efficiency. However, the current SNN is trained to infer over a fixed duration, overlooking the potential of dynamic inference in SNN. In this paper, we strengthen the marriage between SNN and event-driven processing with a proposal to consider a cutoff in SNN, which can terminate SNN anytime during inference to achieve efficient inference. Two novel optimisation techniques are presented to achieve inference efficient SNN: a Top-K cutoff and a regularisation.The proposed regularisation influences the training process, optimising SNN for the cutoff, while the Top-K cutoff technique optimises the inference phase. We conduct an extensive set of experiments on multiple benchmark frame-based…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Memory and Neural Computing · Neural Networks and Applications · Neural dynamics and brain function
