Pith. sign in

REVIEW 1 cited by

Advancing Training Efficiency of Deep Spiking Neural Networks through Rate-based Backpropagation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.11488 v2 pith:QYVZGAOL submitted 2024-10-15 cs.LG cs.NE

classification cs.LGcs.NE
keywords trainingbpttbackpropagationmethodrate-basedsnnscomputationaldeep
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent insights have revealed that rate-coding is a primary form of information representation captured by surrogate-gradient-based Backpropagation Through Time (BPTT) in training deep Spiking Neural Networks (SNNs). Motivated by these findings, we propose rate-based backpropagation, a training strategy specifically designed to exploit rate-based representations to reduce the complexity of BPTT. Our method minimizes reliance on detailed temporal derivatives by focusing on averaged dynamics, streamlining the computational graph to reduce memory and computational demands of SNNs training. We substantiate the rationality of the gradient approximation between BPTT and the proposed method through both theoretical analysis and empirical observations. Comprehensive experiments on CIFAR-10, CIFAR-100, ImageNet, and CIFAR10-DVS validate that our method achieves comparable performance to BPTT counterparts, and surpasses state-of-the-art efficient training techniques. By leveraging the inherent benefits of rate-coding, this work sets the stage for more scalable and efficient SNNs training within resource-constrained environments. Our code is available at https://github.com/Tab-ct/rate-based-backpropagation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimization of Low-Latency Spiking Neural Networks Utilizing Historical Dynamics of Refractory Periods

    cs.NE 2025-06 conditional novelty 5.0 of 10

    A refractory period that adapts using the neuron's membrane potential derivative and its own history improves low-latency spiking network accuracy, cuts redundant spikes, and boosts noise robustness.

Pith tools