arXiv:2606. 11236v1 Announce Type: cross Abstract: Training deep spiking neural networks (SNNs) remains challenging due to sharp loss landscapes and temporal inconsistency caused by surrogate gradients.
By Yechan Kang, Yongjin Kweon, Mingyeong Seo, Sohee Park, Yeonguk Jeon, Jongkil Park, Hyun Jae Jang, Jaewook Kim, YeonJoo Jeong, Suyoun Lee, Seongsik Park
The paper introduces SpiKFAX, a second‑order optimization technique for Spiking Neural Networks (SNNs) that uses a Kronecker‑factored approximation of the Fisher information matrix tailored to the sparse, discrete, and temporally recurrent dynamics of SNNs. By addressing the sharp loss landscape that hampers training with conventional optimizers, SpiKFAX improves test accuracy and training stability across five architectures and seven datasets. The method offers a computationally tractable alternative to existing curvature‑based approaches for SNNs.
By Ngoc Phu Doan, Ihsen Alouani
arXiv:2605.30361v2 Announce Type: replace-cross
Abstract: Spiking Neural Networks (SNNs) offer compelling energy efficiency on neuromorphic hardware, yet their training remains challenging because th...
By Dhruv Patankar, Sachit Ramesha Gowda
arXiv:2606. 20151v1 Announce Type: cross Abstract: This work proposes a hybrid ANN-SNN pipeline that effectively leverages the rich embeddings of pretrained artificial neural networks (ANNs) to enable high-performance spiking neural networks (SNNs).
By Denis Larionov, Khairutin Shtanchaev, Mikhail Kiselev, Mikhail Korovin, Ivan Tugoy
arXiv:2608. 13702v1 Announce Type: cross Abstract: Spiking neural networks (SNNs) offer an energy-efficient alternative to conventional deep neural networks by exploiting sparse event-driven computation, but their training remains challenging because the non-differentiable spike function requires surrogate gradients whose fixed shape may be suboptimal across layers and training stages.
By Kiran Nair, Rodrigue Rizk, KC Santosh
The paper demonstrates that for a broad class of spiking neuron models, including the leaky integrate‑and‑fire with subtractive reset, any approximation bound proven for multi‑spike networks can be translated to an equivalent single‑spike network with only a linear change in neuron count, and vice versa. This establishes that single‑spike and multi‑spike neural networks possess identical approximation capabilities for general machine learning tasks. Consequently, existing approximation results for single‑spike networks automatically extend to the multi‑spike case.
By Dominik Dold, Philipp Christian Petersen