ABSTRACT Spiking neural networks (SNNs) possess great potential for energy‐efficient computation; however, their practical deployment is often constrained by the high computational cost associated with training across multiple time steps. Unlike previous approaches that simply reduce the number of time steps, this work investigates temporal feature redundancy and reveals the feature overlapping phenomenon in SNNs—showing that substantial computational redundancy exists across temporal dimensions. To address this issue, we propose our core contribution, temporal differential decoupling (TDD), which transforms network computation into the differential domain to disentangle static and dynamic feature components. This decoupling enables focused processing of informative signals and significantly reduces redundant computation without compromising model accuracy. Building upon this framework, we further design the TDD‐based differential domain low‐sparsity approximation (TDD‐DDLA) algorithm, which is based on the gradient sensitivity criterion, as an implementation strategy to quantify each temporal feature's contribution to gradient updates and achieve efficient energy optimization. In contrast to prior studies that only adjusted time steps without explicit feature‐level analysis, our framework provides a structured and theoretically grounded analysis of temporal feature evolution. Experimental results demonstrate that our method achieves up to 80.9% fewer spikes per time step and 57.8% fewer total spikes, with no degradation in classification performance, offering a promising pathway toward scalable, low‐cost, and high‐accuracy SNN deployment.
Liu et al. (2026) studied this question.