mlsanityData to 7 Oct 2026

Comprehensive SNN Compression Using ADMM Optimization and Activity Regularization

arXiv 1911.00822 ↗First posted 3 Nov 2019cs.NE cs.LG eess.SPcited by 38

Not on the map. Why?

Abstract (arXiv)

As well known, the huge memory and compute costs of both artificial neural networks (ANNs) and spiking neural networks (SNNs) greatly hinder their deployment on edge devices with high efficiency. Model compression has been proposed as a promising technique to improve the running efficiency via parameter and operation reduction. Whereas, this technique is mainly practiced in ANNs rather than SNNs. It is interesting to answer how much an SNN model can be compressed without compromising its functionality, where two challenges should be addressed: i) the accuracy of SNNs is usually sensitive to model compression, which requires an accurate compression methodology; ii) the computation of SNNs is event-driven rather than static, which produces an extra compression dimension on dynamic spikes. To this end, we realize a comprehensive SNN compression through three steps. First, we formulate the connection pruning and weight quantization as a constrained optimization problem. Second, we combine spatio-temporal backpropagation (STBP) and alternating direction method of multipliers (ADMM) to solve the problem with minimum accuracy loss. Third, we further propose activity regularization to reduce the spike events for fewer active operations. These methods can be applied in either a single way for moderate compression or a joint way for aggressive compression. We define several quantitative metrics to evaluation the compression performance for SNNs. Our methodology is validated in pattern recognition tasks over MNIST, N-MNIST, CIFAR10, and CIFAR100 datasets, where extensive comparisons, analyses, and insights are provided. To our best knowledge, this is the first work that studies SNN compression in a comprehensive manner by exploiting all compressible components and achieves better results.

Key facts. Cited by 38 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Nov 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 8; 2023: 9; 2024: 7; 2025: 8; 2026: 2.

38 papers.

Sort:

  1. 2023Spike-driven Transformercited by 141
  2. 2022Attention Spiking Neural Networkscited by 103
  3. 2021Pruning of Deep Spiking Neural Networks through Gradient Rewiringcited by 41
  4. 2022Exploring Lottery Ticket Hypothesis in Spiking Neural Networkscited by 25
  5. 2023ESL-SNNs: An Evolutionary Structure Learning Strategy for Spiking Neural Networkscited by 22
  6. 2021Spatio-Temporal Pruning and Quantization for Low-latency Spiking Neural Networkscited by 16
  7. 2023Inherent Redundancy in Spiking Neural Networkscited by 13
  8. 2023A Unified Framework for Soft Threshold Pruningcited by 12
  9. 2025Quantized Spike-driven Transformercited by 12
  10. 2024Sparse Spiking Neural Network: Exploiting Heterogeneity in Timescales for Pruning Recurrent SNNcited by 10
  11. 2024FSTA-SNN:Frequency-based Spatial-Temporal Attention Module for Spiking Neural Networkscited by 10
  12. 2022A Synapse-Threshold Synergistic Learning Approach for Spiking Neural Networkscited by 9
26 more
  1. 2022Adaptive Sparse Structure Development with Pruning and Regeneration for Spiking Neural Networkscited by 9
  2. 2024Towards Efficient Deep Spiking Neural Networks Construction with Spiking Activity based Pruningcited by 9
  3. 2021Towards Low-Latency Energy-Efficient Deep SNNs via Attention-Guided Compressioncited by 7
  4. 2022A Spatial-channel-temporal-fused Attention for Spiking Neural Networkscited by 7
  5. 2022Sparse Compressed Spiking Neural Network Accelerator for Object Detectioncited by 6
  6. 2022Developmental Plasticity-inspired Adaptive Pruning for Deep Spiking and Artificial Neural Networkscited by 6
  7. 2025Towards Accurate Binary Spiking Neural Networks: Learning with Adaptive Gradient Modulation Mechanismcited by 5
  8. 2022Ultra-low Latency Spiking Neural Networks with Spatio-Temporal Compression and Synaptic Convolutional Blockcited by 4
  9. 2023Probabilistic Modeling: Proving the Lottery Ticket Hypothesis in Spiking Neural Networkcited by 3
  10. 2023Resource Constrained Model Compression via Minimax Optimization for Spiking Neural Networkscited by 3
  11. 2025Binary Event-Driven Spiking Transformercited by 3
  12. 2021Efficient Visual Recognition with Deep Neural Networks: A Survey on Recent Advances and New Directionscited by 2
  13. 2023Brain-Inspired Efficient Pruning: Exploiting Criticality in Spiking Neural Networkscited by 2
  14. 2024Exploiting Heterogeneity in Timescales for Sparse Recurrent Spiking Neural Networks for Energy-Efficient Edge Computingcited by 2
  15. 2025Memory-Free and Parallel Computation for Quantized Spiking Neural Networkscited by 2
  16. 2025Energy-Efficient and Dequantization-Free Q-LLMs: A Spiking Neural Network Approach to Salient Value Mitigationcited by 2
  17. 2025BSO: Binary Spiking Online Optimization Algorithmcited by 2
  18. 2023The Sparsity Roofline: Understanding the Hardware Limits of Sparse Neural Networkscited by 1
  19. 2024Understanding the Functional Roles of Modelling Components in Spiking Neural Networkscited by 1
  20. 2023ADMM Algorithms for Residual Network Training: Convergence Analysis and Parallel Implementationcited by 0
  21. 2024Toward Efficient Deep Spiking Neuron Networks:A Survey On Compressioncited by 0
  22. 2024Topology Optimization of Random Memristors for Input-Aware Dynamic SNNcited by 0
  23. 2025Spiking Brain Compression: Post-Training Second-order Compression for Spiking Neural Networkscited by 0
  24. 2025NSPDI-SNN: An efficient lightweight SNN based on nonlinear synaptic pruning and dendritic integrationcited by 0
  25. 2026Spiking Layer-Adaptive Magnitude-based Pruningcited by 0
  26. 2026L-SPINE: A Low-Precision SIMD Spiking Neural Compute Engine for Resource-efficient Edge Inferencecited by 0