- Rating
- 2
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Picard-Parallel-Training (PPT) to address the sequential computation bottleneck in training spiking neural networks. By reformulating the membrane dynamics using pre-threshold potentials, the authors enable parallel evaluation through Picard iterations and affine scans. A fused CUDA implementation further improves computational efficiency. The reported speedups are substantial, and PicardSNN achieves competitive results across neuromorphic and long-sequence benchmarks.
Critical strengths
- The paper addresses an important challenge in SNN training. The pre-threshold reformulation is an interesting approach to enabling parallel computation while retaining the original spiking dynamics.
- The combination of theoretical analysis and CUDA implementation is a notable strength. The reported acceleration is impressive, and the experiments cover a diverse range of sequence-learning tasks.
Critical weaknesses
- The gap between theoretical convergence and practical approximation deserves further clarification. The convergence guarantee applies to a smoothed threshold under specific conditions, whereas the implementation uses hard thresholds with a fixed number of Picard iterations. With four iterations, spike agreement is approximately 85–90%. Although the authors report strong downstream accuracy, it remains unclear how these trajectory differences affect training gradients and convergence.
- The reported speedups would benefit from stronger baseline comparisons. The substantial acceleration over sequential BPTT is encouraging, but a comparison with an optimized sequential implementation or existing parallel SNN training methods would help distinguish the benefits of the proposed formulation from those of CUDA kernel optimization.
- The general applicability of PPT remains somewhat uncertain. The main experiments focus on neuron-wise recurrent dynamics, while extensions to more general recurrent connections are primarily discussed theoretically. Additional evidence would strengthen the broader applicability claims.
Questions for authors
- Could the authors provide further evidence that the spike mismatches observed with K=4 have limited effects on training convergence or final accuracy? A comparison with sequential BPTT under identical model configurations would be particularly helpful.
- How does PPT compare with existing parallel SNN training approaches, particularly FPT, in terms of runtime and numerical fidelity? Could the authors clarify how much of the reported speedup comes from the parallel algorithm versus kernel-level optimization?
- Have the authors examined whether the proposed approach maintains similar efficiency and convergence behavior with more general recurrent connections?