arXiv AI

Equivalence of approximation by networks of single- and multi-spike neurons

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.

arXiv Machine Learning
Sep 11

Polyhedral Geometry of Time-to-First-Spike Neural Networks

The paper investigates the expressivity of time-to-first-spike spiking neural networks, showing that each neuron's firing time can be represented in a maxout-like form with many constrained affine pieces. It formalizes causal regions as polyhedral sets defined by fixed causal spike sequences and derives bounds on the number of such regions for both shallow and multilayer networks. Experiments confirm that spiking networks can produce richer input-space partitions than conventional feedforward ReLU networks.

By Manjot Singh, Guido Mont\'ufar, Gitta Kutyniok
Hugging Face Trending Papers
Aug 18

Noisy group neurons with synchronous resetting for high-performance spiking neural networks

The paper introduces a noisy group neuron (NGN) model that uses synchronous resetting and neural stochasticity to improve spiking neural networks (SNNs). It combines this model with a mean‑field backpropagation framework and demonstrates superior performance on several benchmark datasets, achieving 87.35% accuracy on CIFAR10‑DVS in just 10 inference steps.

arXiv Machine Learning
Aug 27

MeMark: Membrane-Space Watermarking for Spiking Neural Networks

MeMark introduces a watermarking scheme for Spiking Neural Networks that embeds a multi‑bit identifier directly into the membrane state of selected Leaky Integrate‑and‑Fire neurons, rather than in the output head. The watermark is recoverable by comparing neuron firing thresholds, eliminating the need for a learned decoder. Experiments on various SNN architectures—including a 215.4M‑parameter SpikeGPT checkpoint—show that all 20 independent 64‑bit keys reliably pass verification under a 51/64 rule, remain robust after fine‑tuning, pruning, quantization, and output‑head replacement, and are not recovered by random keys or adaptive attacks within the tested threat model.

By Roberto Ria\~no, Gorka Abad, Stjepan Picek, Aitor Urbieta
arXiv Machine Learning
4d ago

Theoretical Guarantees for One-Shot Magnitude Pruning and Compute-Adaptive Early Exit

The paper investigates how to reduce computation in neural networks by combining one‑shot magnitude pruning in a static setting with early exit in an adaptive setting. In a simplified single‑neuron model it proves a concentration theorem for pruning and introduces a conditional perceptron whose excess error decreases as a power of the compute gap, with the exponent increasing as partial and full computations align. The authors extend these results to deep networks, showing how pruning distortions accumulate with depth and deriving a compute‑accuracy trade‑off for frozen‑backbone early exit under a Gaussian process framework, with numerical simulations supporting the theoretical scaling laws.

By Erdem Koyuncu
arXiv Machine Learning
Jun 11

A2SG:Adaptive and Asymmetric Surrogate Gradients for Training Deep Spiking Neural Networks

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