- Rating
- 4
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes Piecewise Few-Spike (PWFS) neurons for accurate and efficient ANN-to-SNN conversion. Building upon the Few-Spike (FS) neuron framework, the authors introduce a piecewise approximation strategy with time-dependent neuron parameters to better approximate nonlinear activation functions. The paper also provides theoretical convergence guarantees and explicit approximation error bounds. Extensive experiments across vision models and language models, including Qwen3, demonstrate that PWFS can effectively preserve the performance of the original ANNs.
Critical strengths
The research idea to extend the FS-neuron (Stöckl & Maass 2021) for ANN-to-SNN conversion is interesting and novel. And the paper provides a solid theoretical analysis of existing conversion methods and establishes error bounds estimation for the proposed PWFS neuron and conversion framework.
Further more, experiments span across different archs and datasets, showing excellent nonlinear approximation performance. The proposed PWFS achieves accurate approximations of complex nonlinear activation functions, including GELU, SiLU, and Sigmoid, which are important components in modern Transformer architectures.
Critical weaknesses
The proposed method builds upon the FS neuron introduced by Stöckl and Maass (2021). It would be better if the authors could explicitly clarify the key modifications compared with the original FS formulation.
The experimental results on large-scale architectures (Qwen3) are impressive. However, the paper would benefit from a more detailed explanation of how each components are actually converted into spiking operations. For example, modern architectures contain many operations that are challenging to implement with SNNs, such as Layer normalization, large GEMM in attention and FNN, and softmax. It is therefore important to clarify the converison detail and the architecture after conversion. Since parameter adjustments is required, can authors discuss how these mechanisms could be efficiently implemented on existing neuromorphic hardware.
A final concern is code availability and reproducibility. It would be beneficial if the authors could release their implementation for reproducibility. At least providing the inference code.
Questions for authors
See in weaknesses
We thank Reviewer NRCA for the time taken to assess our work and for the valuable feedback. Below we address the remaining points raised specifically by this reviewer:
Key modifications to original FS neurons. Standard FS neurons use a single schedule of thresholds, reset values, and spike weights across the entire input domain. Although these parameters vary over time, their schedule is fixed independently of the input. PWFS introduces an interval-dependent schedule through a two-phase computation. Offline, we construct a piecewise-linear approximation of the target function. During inference, Phase 1 identifies the interval containing the input and subtracts its left endpoint from the membrane potential. Phase 2 then applies FS dynamics to this residual input, with thresholds and reset values scaled by the selected interval’s width, spike weights scaled by its output increment, and an output bias corresponding to its left endpoint. Thus, PWFS uses FS dynamics to approximate each local affine segment, allowing the effective slope and offset to vary across the input domain. The two phases require M interval-search steps followed by K FS approximation steps.
Code availability and reproducibility. We agree on this point. We are finalizing the codebase and plan to release it publicly upon the paper’s acceptance.
Implementation of parameter adjustment on existing neuromorphic hardware. The parameter adjustment mechanism proposed in this work involves event-driven updates and is straightforward to map onto the neuromorphic hardware platforms currently available to us. While a comprehensive analysis of hardware implementation is outside the immediate scope of this paper, we acknowledge its importance, alongside the latency and efficiency comparisons mentioned by other reviewers and plan to address this in future work.