EPS
← All batches·2605.20289

Plug-and-Play Spiking Operators: Breaking the Nonlinearity Bottleneck in Spiking Transformers

topic: current_projecttop score: 100released: 2026-05-22first surfaced: 2026-05-21arXivPDFlinked_to_results2026-05-212026-05-22

Authors: Xinzhe Yuan (IASM, Harbin Institute of Technology), Xiang Peng (IASM et al.

arXiv · PDF

Summary

arXiv:2605. 20289v1 Announce Type: new Abstract: ANN-to-SNN conversion offers a practical, training-free route to spiking large language models.

Relevance

Read next because Plug-and-Play Spiking Operators: Breaking the Nonlinearity Bottleneck in Spiking Transformers overlaps with clean result "Only continuous soft prefixes hit both EM axes at once on Qwen-2.5-7B-Instruct: discrete prompt searches split between the alignment objective and the distributional objective, and both discretizations of the soft prefix collapse (MODERATE confidence)", clean result "The marker is a representational handle, not a behavioural one — sharing it between a villain persona and the assistant transfers no misalignment (HIGH confidence)", experiment "Implement Chen et al. persona-vector extraction recipe and compare to project's centroid-difference recipe". Matching terms: soft, eval, line, rate, implement, without, language, model. Source: arxiv cs.LG (Machine Learning).

Abstract

arXiv:2605.20289v1 Announce Type: new Abstract: ANN-to-SNN conversion offers a practical, training-free route to spiking large language models. However, current pipelines primarily focus on spike-driven realizations for Transformer linear-algebra operations, while providing limited support for key nonlinear operators. This gap limits compatibility with neuromorphic-style execution constraints, where such nonlinearities typically require division, exponentiation, or norm computations that are not naturally supported by standard leaky integrate-and-fire dynamics. To solve this problem, we propose a plug-and-play framework that implements spike-friendly approximations for Transformer nonlinearities and integrates into existing ANN-to-SNN pipelines. Our method decomposes these nonlinear computations into three recurring primitives -- division, exponentiation, and $\ell_2$ norms -- and realizes them via population computation using LIF neuron groups, combined with lightweight bit-shift scaling to avoid floating-point arithmetic. By composing these primitives as modular operator blocks, our framework supports common Transformer nonlinearities (e.g., Softmax, SiLU, and normalization) without any fine-tuning. Experiments on a range of LLMs Transformers show that selectively replacing the targeted nonlinear operators incurs less than a $1%$ accuracy drop across all evaluated tasks.