T EMPORAL E FFICIENT T RAINING OF S PIKING N EURAL N ETWORK VIA G RADIENT R E - WEIGHTING
A BSTRACT
Recently, brain-inspired spiking neuron networks (SNNs) have attracted widespread research interest because of their event-driven and energy-efﬁcient characteristics.
Still, it is difﬁcult to efﬁciently train deep SNNs due to the nondifferentiability of its activation function, which disables the typically used gradient descent approaches for traditional artiﬁcial neural networks (ANNs).
Although the adoption of surrogate gradient (SG) formally allows for the back-propagation of losses, the discrete spiking mechanism actually differentiates the loss landscape of SNNs from that of ANNs, failing the surrogate gradient methods to achieve comparable accuracy as for ANNs.
In this paper, we ﬁrst analyze why the current direct training approach with surrogate gradient results in SNNs with poor generalizability.
Then we introduce the temporal efﬁcient training (TET) approach to compensate for the loss of momentum in the gradient descent with SG so that the training process can converge into ﬂatter minima with better generalizability.
Meanwhile, we demonstrate that TET improves the temporal scalability of
SNN and induces a temporal inheritable training for acceleration.
Our method consistently outperforms the SOTA on all reported mainstream datasets, including CIFAR-10/100 and ImageNet.
Remarkably on DVS-CIFAR10, we obtained 83 % top-1 accuracy, over 10 % improvement compared to existing state of the art.
Codes are available at https://github.com/Gus-Lab/temporal_
efficient_training .
I NTRODUCTION
The advantages of Spiking neuron networks (SNNs) lie in their energy-saving and fast-inference computation when embedded on neuromorphic hardware such as TrueNorth (DeBole et al., 2019) and Loihi (Davies et al., 2018).
Such advantages originate from the biology-inspired binary spike transmitted mechanism, by which the networks avoid multiplication during inference.
On the other hand, this mechanism also leads to difﬁculty in training very deep SNNs from scratch because the non-differentiable spike transmission hinders the powerful back-propagation approaches like gradient descents.
Recently, many studies on converting artiﬁcial neuron networks (ANNs) to SNNs have demonstrated SNNs’ comparable power in feature representation as ANNs (Han & Roy, 2020;
Deng & Gu, 2020; Li et al., 2021a).
Nevertheless, it is commonly agreed that the direct training method for high-performance SNN is still crucial since it distinguishes SNNs from converted ANNs, especially on neuromorphic datasets.
The output layer’s spike frequency or the average membrane potential increment is commonly used as inference indicators in SNNs (Shrestha & Orchard, 2018;
Kim et al., 2019).
The current standard direct training (SDT) methods regard the SNN as RNN and optimize inference indicators’ distribution (Wu et al., 2018).
They adopt surrogate gradients (SG) to relieve the non-differentiability (Lee et al., 2016;
Wu et al., 2018; Zheng et al., 2021).
However, the gradient descent with SG does not match with the loss landscape in SNN and is easy to get trapped in a local minimum with low generalizability.
Although using suitable optimizers and weight decay help ease this problem, the performance of deep SNNs trained from scratch still suffers a big deﬁcit compared to that of ANNs
Deng et al.
Another training issue is the memory and time consumption, which increases
[Figure]
𝐿(𝑂
[Figure]
,𝑦)
Label 1 𝑇 ෍ 𝑡 𝐿(𝑂 𝑡 ,𝑦) 𝑂 𝑚𝑒𝑎𝑛 𝑂(𝑡)
Leaky Integrate-Fire
Surrogate Gradient
Output Integrate
Standard Direct Training
Temporal Efficient Training
Post
[Figure]
spike 𝜕𝐿 𝜕𝑂(𝑡)= 1 𝑇𝐿′(𝑂 𝑚𝑒𝑎𝑛 ,𝑦)
[Figure]
𝜕𝑂(𝑡)
[Figure]
1 𝑇𝐿′(𝑂 𝑡 ,𝑦)
[Figure]
linearly with the simulation time.
Rathi & Roy (2020) initializes the target network by a converted
SNN to shorten the training epochs, indicating the possibility of high-performance SNN with limited activation time.
The training problem due to the non-differentiable activation function has become the main obstruction of spiking neural network development.
In this work, we examine the limitation of the traditional direct training approach with SG and propose the temporal efﬁcient training (TET) algorithm.
Instead of directly optimizing the integrated potential, TET optimizes every moment’s pre-synaptic inputs.
As a result, it avoids the trap into local minima with low prediction error but a high second-order moment.
Furthermore, since the
TET applies optimization on each time point, the network naturally has more robust time scalability.
Based on this characteristic, we propose the time inheritance training (TIT), which reduces the training time by initializing the SNN with a smaller simulation length.
With the help of TET, the performance of SNNs has improved on both static datasets and neuromorphic datasets.
Figuredepicts the workﬂow of our approach.
The following summarizes our main contributions:
• We analyze the problem of training SNN with SG and propose the TET method, a new loss and gradient descent regime that succeeds in obtaining more generalizable SNNs.
• We analyze the feasibility of TET and picture the loss landscape under both the SDT and TET setups to demonstrate TET’s advantage in better generalization.
• Our sufﬁcient experiments on both static datasets and neuromorphic datasets prove the effectiveness of the TET method.
Especially on DVS-CIFAR10, we report 83 .
17% topaccuracy for the ﬁrst time, which is over 10% better than the current state-of-the-art result.
R ELATED W ORK
In recent years, SNNs have developed rapidly and received more and more attention from the research community.
However, lots of challenging problems remain to be unsolved.
In general, most works on SNN training have been carried out in two strategies: ANN-to-SNN conversion and direct training from scratch.
ANN-to-SNN Conversion.
Conversion approaches avoid the training problem by trading high accuracy through high latency.
They convert a high-performing ANN to SNN and adjust the SNN parameters w.r.t the ANN activation value layer-by-layer (Diehl et al., 2015; 2016).
Some special techniques have been proposed to reduce the inference latency, such as the subtraction mechanism (Rueckauer et al., 2016; Han et al., 2020), robust normalization Rueckauer et al.
(2016), spike-norm (Sengupta et al., 2018), and channel-wise normalization
(Kim et al., 2019).
Recently, Deng & Gu
(2020) decompose the conversion error to each layer and reduce it by bias shift.
Li et al.
(2021a) suggest using adaptive threshold and layer-wise calibration to obtain high-performance SNNs that require a simulation length of less than 50.
However, converted methods signiﬁcantly extend the inference latency, and they are not suitable for neuromorphic data (Deng et al., 2020).
Direct training.
In this area, SNNs are regarded as special RNNs and training with BPTT (Neftci et al., 2019).
On the backpropagation process, The non-differentiable activation term is replaced with a surrogate gradient (Lee et al., 2016).
Compared with ANN-to-SNN conversion, direct training achieves high accuracy with few time steps but suffers more training costs (Deng et al., 2020).
Several studies suggest that surrogate gradient (SG) is helpful to obtain high-performance SNNs on both static datasets and neuromorphic datasets (Wu et al., 2019; Shrestha & Orchard, 2018; Li et al., 2021b).
On the backpropagation process, SG replaces the Dirac function with various shapes of curves.
Exceptionally, Wu et al.
ﬁrst propose the STBP method and train SNNs on the
ANN programming platform, which signiﬁcantly promotes direct training development.
Zheng et al.
(2021) further proposes the tdBN algorithm to smooth the loss function and ﬁrst realize training a large-scale SNN on ImageNet.
Zhang & Li (2020) proposes TSSL-BP to break down error backpropagation across two types of inter-neuron and intra-neuron dependencies and achieve low-latency and high accuracy SNNs.
Recently, Yang et al.
(2021) designed a neighborhood aggregation (NA) method to use the multiple perturbed membrane potential waveforms in the neighborhood to compute the ﬁnite difference gradients and guide the weight updates.
They signiﬁcantly decrease the required training iterations and improve the SNN performance.
P RELIMINARY 3. I TERATIVE LIF M ODEL
We adopt the Leaky Integrate-and-Fire (LIF) model and translate it to an iterative expression with the Euler method (Wu et al., 2019).
Mathematically, the membrane potential is updated as
[Equation]
where τ is the constant leaky factor, u ( t ) is the membrane potential at time t , and I ( t ) denotes the pre-synaptic inputs, which is the product of synaptic weight W and spiking input x ( t ) .
Given a speciﬁc threshold V th , the neuron ﬁres a spike and u ( t ) reset to 0 when the u ( t ) exceeds the threshold.
So the ﬁring function and hard reset mechanism can be described as
[Equation]
where Θ denotes the Heaviside step function.
The output spike a ( t + 1) will become the post synaptic spike and propagate to the next layer.
In this study, we set the starting membrane u (0) to 0, the threshold V th to 1 , and the leaky factor τ to 0.5 for all experiments.
The last layer’s spike frequency is typically used as the ﬁnal classiﬁcation index.
However, adopting the LIF model on the last layer will lose information on the membrane potential and damage the performance, especially on complex tasks (Kim et al., 2019).
Instead, we integrate the pre-synaptic inputs I ( t ) with no decay or ﬁring (Rathi & Roy, 2020; Fang et al., 2021).
Finally, we set the average membrane potential as the classiﬁcation index and calculate the cross-entropy loss for training.
3. S URROGATE GRADIENT
Following the concept of direct training, we regard the SNN as RNN and calculate the gradients through spatial-temporal backpropagation (STBP) (Wu et al., 2018):
[Equation]
where the term ∂ a ( t ) ∂ u ( t ) is the gradient of the non-differentiability step function involving the derivative of Dirac’s δ -function that is typically replaced by surrogate gradients with a derivable curve.
So far, there are various shapes of surrogate gradients, such as rectangular (Wu et al., 2018; 2019), triangle
(Esser et al., 2016; Rathi & Roy, 2020), and exponential (Shrestha & Orchard, 2018) curve.
In this work, we choose the surrogate gradients shaped like triangles.
Mathematically, it can describe as
[Equation]
where the γ denotes the constraint factor that determines the sample range to activate the gradient.
3. B ATCH N ORMALIZATION FOR SNN
Batch Normalization (BN) (Ioffe & Szegedy, 2015) is beneﬁcial to accelerate training and increase performance since it can smooth the loss landscape during training (Santurkar et al., 2018).
Zheng et al.
modiﬁed the forward time loop form and proposed threshold-dependent Batch Normalization (tdBN) to normalize the pre-synaptic inputs I in both spatial and temporal paradigms so that the BN can support spatial-temporal input.
We adopt this setup with the extension of the time dimension to batch dimension 1 .
In the inference process, the BN layer will be merged into the pre-convolutional layer, thus the inference rule of SNN remain the same but with modiﬁed weight:
[Equation]
[Equation]
where µ, α are the running mean and standard deviation on both spatial and temporal paradigm, γ, β are the afﬁne transformation parameters, and W , b are the parameters of the pre-convolutional layer.
M ETHODOLOGY 4. F ORMULA OF T RAINING SNN WITH SURROGATE GRADIENTS
Standard Direct Training.
We use O ( t ) to represent pre-synaptic input I ( t ) of the output layer and calculate the cross-entropy loss.
The loss function of standard direct training L SDT is:
[Equation]
where T is the total simulation time, L CE denotes the cross-entropy loss, and y represents the target label.
Following the chain rule, we obtain the gradient of W with softmax S ( · ) inference function :
[Equation]
where O mean denotes the average of the output O ( t ) over time, and ˆ y is the one-hot coding of y .
Temporal Efﬁcient Training.
In this section, we come up with a new kind of loss function L TET to realize temporal efﬁcient training (TET).
It constrains the output (pre-synaptic inputs) at each moment to be close to the target distribution.
It is described as:
[Equation]
Recalculate the gradient of weights under the loss function L TET , and we have:
[Equation]
4. C ONVERGENCE OF G RADIENT D ESCENT FOR SDT V . S . TET
In the case of SDT, the gradient consists of two parts, the error term ( S ( O mean ) − ˆ y ) and the partial derivative of output ∂ O ( t ) /∂
W .
When the training process reaches near a local minimum, the term
( S ( O mean ) − ˆ y ) approximates 0 for all t
= 1 , ..., T , ignorant of the term ∂ O ( t ) /∂
W .
For traditional
ANNs, the accumulated momentum may help get out of the local minima (e.g. saddle point) that typically implies bad generalizability (Kingma & Ba, 2014; Kidambi et al., 2018).
However, when the SNN is trained with surrogate gradients, the accumulated momentum could be extremely small, considering the mismatch of gradients and losses.
The fact that the activation function is a step one while the SG is bounded with integral constraints.
This mismatch dissipates the momentum around a local minimum and stops the SDT from searching for a ﬂatter minimum that may suggest better generalizability.
In the case of TET, this issue of mismatch is relieved by reweighting the contribution of ∂ O ( t ) /∂
W .
Indeed, considering the fact that the ﬁrst term ( S ( O ( t )) − ˆ y ) is impossible to be 0 at every moment of SNN since the early output accuracy on the training set is not 100 % .
So TET needs the second term ∂ O ( t ) /∂
W close to 0 to make the L TET convergence.
This mechanism increases the norm of gradients around sharp local minima and drives the TET to search for a ﬂat local minimum where the disturbance of weight does not cause a huge change in O ( t ) .
Further, to ensure that the convergence with TET implies the convergence of SDT, we prove the following lemma:
Lemma 4.1.
L SDT is upper bounded by L TET .
Proof.
Suppose O i ( t ) and ˆ y i denote the i-th component of O ( t ) and ˆ y , respectively.
Expand Eqn.9, we have:
[Equation]
where the ﬁrst inequality is given by the Arithmetic Mean-Geometric Mean Inequality, and the second one is given by Jensen Inequality since the softmax function is convex.
As a corollary, once the L TET gets closed to zero, the original loss function L SDT also approaches zero.
Furthermore, the network output O ( t ) at a particular time point may be a particular outlier that dramatically affects the total output since the output of the SNN has the same weight at every moment under the rule of integration.
Thus it is necessary to add a regularization term like L MSE loss to conﬁne each moment’s output to reduce the risk of outliers:
[Equation]
where φ is a constant used to regularize the membrane potential distribution.
And we set φ =
V th in our experiments.
In practice, we use a hyperparameter λ to adjust the proportion of the regular term, we have:
[Equation] [Equation]
It is worth noting that we only changed the loss function in the training process and did not change
SNN’s inference rules in the testing phase for a fair comparison.
This algorithm is detailed in Algo.1.
4. T IME I NHERITANCE T RAINING
SNN demands simulation length long enough to obtain a satisfying performance, but the training time consumption will increase linearly as the simulation length grows.
So how to shorten the training time is also an essential problem in the direct training ﬁeld.
Traditional loss function L SDT only optimizes the whole network output under a speciﬁc T , so its temporal scalability is poor.
Unlike the standard training, TET algorithm optimizes each moment’s output, enabling us to extend λ the simulation time naturally.
We introduce Time Inheritance Training (TIT) to alleviate the training time problem.
We ﬁrst use long epochs to train an SNN with a short simulation time T, e.g., 2.
Then, we increase the simulation time to the target value and retrain with short epochs.
We discover that
TIT performs better than training from scratch on accuracy and signiﬁcantly saves the training time.
Assuming that training an SNN with simulation length T = 1 cost ts time per epoch, the SNN needs 300 epochs to train from scratch, and the TIT needs 50 epochs for ﬁnetuning.
So we need 1800 ts time to train an SNN with T = 6 from scratch, but following the TIT pipeline with the initial T =only requires 900 ts .
As a result, the TIT can reduce the training time cost by half.
E XPERIMENTS
We validate our proposed TET algorithm and compare it with existing works on both static and neuromorphic datasets.
The network architectures in this paper include ResNet-19 (Zheng et al., 2021),
Spiking-ResNet
(Zheng et al., 2021), SEW-ResNet34 (Fang et al., 2021), SNN-5, and
VGGSNN.
SNN-5 (16C3-64C5-AP2-128C5-AP2-256C5-AP2-512C3-AP2-FC) is a simple convolutional SNN suitable for multiple runs to discover statistical rules (Figure A. 7).
The architecture of VGGSNN (64C3-128C3-AP2-256C3-256C3-AP2-512C3-512C3-AP2-512C3-512C3-AP2FC) is based on VGG11 with two fully connected layers removed as we found that additional fully connected layers were unnecessary for neuromorphic datasets.
5. M ODEL V ALIDATION AND A BLATION S TUDY
Effectiveness of TET over SDT with SG.
We ﬁrst examine whether the mismatch between SG and loss causes the convergence problem.
For this purpose, we set the simulation length to 4 and change the spike function Θ in Eqn.2 to Sigmoid σ ( k · input ) .
We ﬁnd that the TET and SDT achieved similar accuracy (Table 2)
when k
= 1 , 10 , 20 .
This indicates that both TET and SDT work when the gradient and loss function match each other.
Next, we compare the results training with L SDT and
L TET on SNNs (ResNet-19 on CIFAR100) training with surrogate gradient for three runs.
As shown in Table 1, our proposed new TET training strategy dramatically increases the accuracy by 3.25 % when the simulation time is 4 and 3.53 % when the simulation time is 6.
These results quantitatively support the effectiveness of TET in solving the mismatch between gradient and loss in training SNNs with SG.
Loss Landscape around Local Minima.
We further inspect the 2D landscapes (Li et al., 2018) of
L SDT and L TET around their local minima (see Figure.
to demonstrate why TET generalizes better than SDT and how TET helps the training process jump out of the sharp local minima typically found by SDT.
First, comparing Figure.
2 A and C, we can see that although the values of local minima achieved by SDT and TET are similar in L SDT , the local minima of TET (Figure.
2 C) is ﬂatter than that of SDT (Figure.
2 A).
This indicates that the TET is effective in ﬁnding ﬂatter
[Figure]
We adopt the SNN architecture ResNet-19 with
SG on CIFAR100 and record the results with three different simulation lengths 2, 4, and 6.
[Figure]
[Table] [Table]
minima that are typically more generalizable even w.r.t the original loss in TET.
Next, we examine the two local minima under L TET to see how it helps jump out the local minima found by SDT.
When comparing Figure.
2 B and D, we observe that the local minima found by SDT (Figure.
2 B) is not only sharper than that found by TET (Figure.
2 D) under L SDT
but also maintains a higher loss value.
This supports our claim that TET loss cannot be easily minimized around sharp local minima (Figure.
2 B), thus preferable to converge into ﬂatter local minima (Figure.
2 D).
Put together, the results here provide evidence for our reasoning in Section 4.2.
Training from SDT to TET.
In this part, we further validate the ability of TET to escape from the local minimum found by SDT.
We adopt the VGGSNN with 300 epochs training on DVS-CIFAR10.
First, we optimize L SDT for 200 epochs and then change the loss function to L TET after epoch 200.
Figure 3 demonstrates the accuracy and loss change on the test set.
After 200 epochs training, SDT gets trapped into a local minimum, and the L SDT no longer decreases.
The L TET is much higher than L SDT since SDT does not optimize it.
Nevertheless, after we change the loss function to L TET , the L TET and L SDT on the test set both have a rapid decline.
This phenomenon illustrates the TET ability to help the SNN efﬁciently jump out of the local minimum with poor generalization and ﬁnd another ﬂatter local minimum.
[Figure]
Simulation length (T)
A cc u r ac y 70.
Energy (mJ)
A cc u r ac y
Direct training Indirect training 69.
T = T =
T = T =
T = T =
T = T =
T = T =
A
B
[Figure]
Time Scalability Robustness.
Here, we study the time scalability robustness of SNNs trained with
TET ( L TET ).
First, we use 300 epochs to train a small simulation length ResNet-19 on CIFAR as the initial SNN.
Then, we directly change the simulation length from 2 to 8 without ﬁnetuning and report the network accuracy on the test set.
Figure.
A displays the results after changing the simulation length.
We use 2, 3, and 4, respectively, as the simulation length of the initial network.
When we increase the simulation length, the accuracy of all networks gradually increases.
After the simulation time reaches a certain value, the network performance will slightly decrease.
Interestingly, SNNs trained from scratch (T=4 and T=6) are not as good as those trained following the TIT procedure.
Network Efﬁciency.
In this section, we measure the relationship between energy consumption and network performance.
SNN avoids multiplication on the inference since its binary activation and event-based operation.
The addition operation in SNN costs 0.9 pJ energy while multiplication operation consumes 4.6 pJ measured in 45nm CMOS technology (Rathi & Roy, 2020).
In our
SNN model, the ﬁrst layer has multiplication operations, while the other layers only have addition operations.
Figure 4.
B summarizes the results of different simulation times.
In all cases, the SNN obtained by TET has higher efﬁciency.
5. C OMPARISON TO EXITING WORKS
In this section, we compare our experimental results with previous works.
We validate the full TIT algorithm ( L TOTAL ) both on the static dataset and neuromorphic dataset.
All of the experiment results are summarized in Table 5.2.
We specify all the training details in the appendix A.1.
CIFAR.
We apply TET and TIT algorithm on CIFAR (Krizhevsky et al., 2009), and report the mean and standard deviation of 3 runs under different random seeds.
The λ is set to 0 .
On CIFAR10, our TET method achieves the highest accuracy above all existing approaches.
Even when T = 2 , there is a 1.82 % increment compare to STBP-tdBN with simulation length T = 6 .
It is worth noting that our method is only 0.47 % lower than the ANN performance.
TET algorithm demonstrates a more excellent ability on CIFAR100.
It has an accuracy increase greater than 3 % on all report simulation lengths.
In addition, when T = 6 , the reported accuracy is only 0.63 % lower than that of ANN.
We can see that the proposed TET’s improvement is even higher on complex data like
CIFAR100, where the generalizability of the model distinguishes a lot among minima with different ﬂatness.
ImageNet.
The training set of ImageNet (Krizhevsky et al., 2012) provides 1.28k training samples for each label.
We choose the two most representative ResNet-34 to verify our algorithm on ImageNet with λ = 0 . 001 .
SEW-ResNet34 is not a typical SNN since it adopts the IF model and modiﬁes the Residual structure.
Although we only train our model for 120 epochs, the TET algorithm achieves a 1.07 % increment
[Table]
DVS-CIFAR10.
The neuromorphic datasets suffer much more noise than static datasets.
Thus the well-trained SNN is easier to overﬁt on these datasets than static datasets.
DVS-CIFAR10 (Li et al., 2017), which provides each label with 0.9k training samples, is the most challenging mainstream neuromorphic dataset.
Recent works prefer to deal with this dataset by complex architectures, which are more susceptible to overﬁtting and do not result in very high accuracy.
Here, we adopt VGGSNN on the DVS-CIFAR10 dataset, set λ = 0 .
001 , and report the mean and standard deviation ofruns under different random seeds.
Along with data augmentation methods, VGGSNN can achieve an accuracy of 77.4 % .
Then we apply the TET method to obtain a more generalizable optima.
The accuracy rises to 83.17 % .
Our TET method outperforms existing state-of-the-art by 11.47 % accuracy.
Without data augmentation methods, VGGSNN obtains 73.3 % accuracy by SDT and 77.3 % accuracy by TET.
C ONCLUSION
This paper focuses on the SNN generalization problem, which is described as the direct training
SNN performs well on the training set but poor on the test set.
We ﬁnd this phenomenon is due to the incorrect SG that makes the SNN easily trapped into a local minimum with poor generalization.
To solve this problem, we propose the temporal efﬁcient training algorithm (TET).
Extensive experiments verify that our proposed method consistently achieves better performance than the SDT process.
Furthermore, TET signiﬁcantly improves the time scalability robustness of SNN, which enables us to propose the time inheritance training (TIT) to signiﬁcantly reduce the training time consumption by almost a half.
A CKNOWLEDGMENT
This project is supported by NSFC 61876032 and JCYJ20210324140807019.
A A PPENDIX A. D ATASET AND T RAINING DETAIL
CIFAR.
The CIFAR dataset (Krizhevsky et al., 2009) consists of 50k training images and 10k testing images with the size of 32 × 32 .
We use ResNet-19 for both CIFAR10 and CIFAR100.
Moreover, random horizontal ﬂip and crop are applied to the training images the augmentation.
First, we use 300 epoch to train the SNN with the simulation length T = 2 .
We use an Adam optimizer with a learning rate of 0.01 and cosine decay to 0.
Next, following the TIT algorithm, we increase the simulation time (to 4 and 6) and continue training the SNN for only 50 epochs, with the learning rate changing to 1 e − 4 .
ImageNet.
ImageNet (Deng et al., 2009) contains more than 1250k training images and 50k validation images.
We crop the images to 224 × 224 and using the standard augmentation for the training data.
We use an SGD optimizer with 0.9 momentum and weight decay 4 e − 5 .
The learning rate is set to 0.1 and cosine decay to 0.
We train the SEW-ResNet34 (Fang et al., 2021) with T = 4 forepochs.
As for the Spiking-ResNet34 (Zheng et al., 2021), we use TIT algorithm to train 90 epochs with T = 4 ﬁrst, then change the simulation time to 6 and ﬁnetune the network for 30 epochs.
We adopt an Adam optimizer on the ﬁnetune phase and change the learning rate to 1 e − 4 .
TIT algorithm signiﬁcantly reduces the training time consumption since training the Spiking-ResNet is extremely slow.
DVS-CIFAR10.
DVS-CIFAR
(Li et al., 2017), the most challenging mainstream neuromorphic data set, is converted from CIFAR10.
It has 10k images with the size 128 × 128.
Following
Samadzadeh et al.
(2020), We split the dataset into 9k training images and 1k test images and reduce the spatial resolution to 48 × 48.
Random horizontal ﬂip and random roll within 5 pixels are taken as augmentation.
We adopt VGGSNN architecture with 300 epochs training on this classiﬁcation task.
And we use an Adam optimizer with the learning rate 1 e − 3 and cosine decay to 0.
As for the case that does not apply any augmentation, we add a weight decay of 5e-4 to the optimizer.
A. L SDT LOSS LANDSCAPE OF R ES N ET -
Here we compare the classiﬁcation loss ( L SDT ) landscapes of ResNet-19 on CIFAR100.
The position around the local minimal value found by the SDT ( L SDT ) is very sharp.
However, the area around the local minimum found by TET ( L TET ) is much smoother (Figure 5), which indicates that
TET effectively improves the network generalization.
Such improvements could be further utilized to other techniques like privacy-preserving data generalization (Kim et al., 2021) and neural architecture search (Kim et al., 2022).
[Figure]
A. E FFECT OF L MSE
In this part, we examine the effect of the regular term L MSE with 5 different levels of λ .
Figure 6 Summarizes the ﬁnal results.
The regular term L MSE effectively increases the performance of both ResNet-19 on CIFAR100 and VGGSNN on DVS-CIFAR10.
The static dataset CIFAR100 is more suitable for larger λ , while smaller λ is suitable for DVS-CIFAR10.
Theoretically, it is hard to obtain satisfying performance at the early simulation moment due to the sparseness of neuromorphic datasets.
So too large regular term L MSE is not suitable for the neuromorphic dataset.
Furthermore, we ﬁnd that a high λ may harm the early training phase on ImageNet, especially if zero-initialize (Goyal et al., 2017) is not performed.
As a result, we set λ to 5 e − 2 for CIFAR10 and CIFAR100, 1 e − 3 for ImageNet and DVS-CIFAR10.
[Figure]
A. STATISTICAL RESULTS
Here we provide statistical results (Figure 7) to prove that the total SNN accuracy is positively associated with every average of moment’s output test accuracy.
We train CNN-5 on CIFAR10 for a total of 20 runs with SDT and 5 runs with TET.
[Figure]
A. T IME SCALABILITY ROBUSTNESS OF SDT AND TET.
Here we ﬁrst show the test accuracy (ResNet19 on CIFAR100) of the membrane potential increment at each moment instead of the integrated membrane potential.
We set the initial simulation length of the SNNs to 3 or 4 and trained them for a full 300 epochs.
Then we expand their simulation length to 8.
As shown in table 4, TET ( L TET ) makes the membrane potential increment at each moment have a higher classiﬁcation ability than SDT ( L SDT ).
And TET (1.41 and 0.08) also acquires a low accuracy variance than SDT (3.81 and 4.04).
Then we compare the time scalability robustness between SDT ( L SDT ) and TET ( L TET ).
We set the initial simulation length of ResNet19 SNNs to 2, 3, 4 and train with SDT or TET.
Then we gradually increase SNN simulation length to 64 and record test accuracy of the integrated membrane potential.
As we increase the simulation length, all the SNNs’ accuracy will ﬁrst increase and then be stable in a certain area.
Meanwhile, TET (1.80) has a small accuracy variance than the SDT (11.13) after
Simulation Length
A cc u r ac y       70 62.
[Figure]
T =
TET
[Figure]
T
[Figure]
=
[Figure]
T =
SDT with T = 4 SDT with T = 3 SDT with T =
TET with T =
[Figure]
TET with T =
[Figure]
TET
[Figure]
T =
Simulation Length
A cc u r ac y r e l a ti v e g r o w t h r a t e 0.
A
B
Method
T= T=
T= T=
T= T=
T= T=
SDT (T=3) 55.
[Table]