CVNov 15, 2025

Sparse by Rule: Probability-Based N:M Pruning for Spiking Neural Networks

arXiv:2511.12097v11 citationsh-index: 2
Originality Incremental advance
AI Analysis

This work addresses the challenge of deploying energy-efficient SNNs on edge devices by providing a flexible pruning method that balances sparsity and hardware acceleration, though it is incremental as it builds on existing pruning techniques.

The paper tackles the problem of high parameter and computational costs in deep spiking neural networks (SNNs) by introducing SpikeNM, a semi-structured N:M pruning framework that learns sparse SNNs from scratch, achieving maintained or improved accuracy at 2:4 sparsity on mainstream datasets while producing hardware-friendly patterns.

Brain-inspired Spiking neural networks (SNNs) promise energy-efficient intelligence via event-driven, sparse computation, but deeper architectures inflate parameters and computational cost, hindering their edge deployment. Recent progress in SNN pruning helps alleviate this burden, yet existing efforts fall into only two families: \emph{unstructured} pruning, which attains high sparsity but is difficult to accelerate on general hardware, and \emph{structured} pruning, which eases deployment but lack flexibility and often degrades accuracy at matched sparsity. In this work, we introduce \textbf{SpikeNM}, the first SNN-oriented \emph{semi-structured} \(N{:}M\) pruning framework that learns sparse SNNs \emph{from scratch}, enforcing \emph{at most \(N\)} non-zeros per \(M\)-weight block. To avoid the combinatorial space complexity \(\sum_{k=1}^{N}\binom{M}{k}\) growing exponentially with \(M\), SpikeNM adopts an \(M\)-way basis-logit parameterization with a differentiable top-\(k\) sampler, \emph{linearizing} per-block complexity to \(\mathcal O(M)\) and enabling more aggressive sparsification. Further inspired by neuroscience, we propose \emph{eligibility-inspired distillation} (EID), which converts temporally accumulated credits into block-wise soft targets to align mask probabilities with spiking dynamics, reducing sampling variance and stabilizing search under high sparsity. Experiments show that at \(2{:}4\) sparsity, SpikeNM maintains and even with gains across main-stream datasets, while yielding hardware-amenable patterns that complement intrinsic spike sparsity.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes