mlsanityData to 14 Oct 2026

Spiking Neural Networks with Dynamic Time Steps for Vision Transformers

arXiv 2311.16456 ↗First posted 28 Nov 2023cs.CV eess.IVcited by 3

Not on the map. Why?

Abstract (arXiv)

Spiking Neural Networks (SNNs) have emerged as a popular spatio-temporal computing paradigm for complex vision tasks. Recently proposed SNN training algorithms have significantly reduced the number of time steps (down to 1) for improved latency and energy efficiency, however, they target only convolutional neural networks (CNN). These algorithms, when applied on the recently spotlighted vision transformers (ViT), either require a large number of time steps or fail to converge. Based on analysis of the histograms of the ANN and SNN activation maps, we hypothesize that each ViT block has a different sensitivity to the number of time steps. We propose a novel training framework that dynamically allocates the number of time steps to each ViT module depending on a trainable score assigned to each timestep. In particular, we generate a scalar binary time step mask that filters spikes emitted by each neuron in a leaky-integrate-and-fire (LIF) layer. The resulting SNNs have high activation sparsity and require only accumulate operations (AC), except for the input embedding layer, in contrast to expensive multiply-and-accumulates (MAC) needed in traditional ViTs. This yields significant improvements in energy efficiency. We evaluate our training framework and resulting SNNs on image recognition tasks including CIFAR10, CIFAR100, and ImageNet with different ViT architectures. We obtain a test accuracy of 95.97% with 4.97 time steps with direct encoding on CIFAR10.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 22 of its 34 references that are in the map. First posted on arXiv 28 Nov 2023.

Builds on

22 of 34 references.

References · 22

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  4. 2019Surrogate Gradient Learning in Spiking Neural Networkscited by 626
  5. 2017Efficient Processing of Deep Neural Networks: A Tutorial and Surveycited by 434
  6. 2020Going Deeper With Directly-Trained Larger Spiking Neural Networkscited by 278
  7. 2022Spikformer: When Spiking Neural Network Meets Transformercited by 271
  8. 2021Escaping the Big Data Paradigm with Compact Transformerscited by 264
  9. 2018Going Deeper in Spiking Neural Networks: VGG and Residual Architecturescited by 245
  10. 2018Direct Training for Spiking Neural Networks: Faster, Larger, Bettercited by 233
  11. 2022Temporal Efficient Training of Spiking Neural Network via Gradient Re-weightingcited by 198
  12. 2020Enabling Deep Spiking Neural Networks with Hybrid Conversion and Spike Timing Dependent Backpropagationcited by 144
10 more
  1. 2021Optimal Conversion of Conventional Artificial Neural Networks to Spiking Neural Networkscited by 139
  2. 2019Enabling Spike-based Backpropagation for Training Deep Neural Network Architecturescited by 123
  3. 2022Training High-Performance Low-Latency Spiking Neural Networks by Differentiation on Spike Representationcited by 89
  4. 2023SEENN: Towards Temporal Spiking Early-Exit Neural Networkscited by 41
  5. 2022SATA: Sparsity-Aware Training Accelerator for Spiking Neural Networkscited by 20
  6. 2022Spikeformer: A Novel Architecture for Training High-Performance Low-Latency Spiking Neural Networkcited by 19
  7. 2021Training Energy-Efficient Deep Spiking Neural Networks with Single-Spike Hybrid Input Encodingcited by 10
  8. 2023To Spike or Not To Spike: A Digital Hardware Perspective on Deep Learning Accelerationcited by 10
  9. 2021Can Deep Neural Networks be Converted to Ultra Low-Latency Spiking Neural Networks?cited by 9
  10. 2022Hoyer regularizer is all you need for ultra low-latency spiking neural networkscited by 4

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 2.

3 papers.