SSTDP: Supervised Spike Timing Dependent Plasticity for Efficient Spiking Neural Network Training

被引:30
作者
Liu, Fangxin [1 ,2 ]
Zhao, Wenbo [2 ,3 ]
Chen, Yongbiao [1 ]
Wang, Zongwu [1 ]
Yang, Tao [1 ]
Jiang, Li [1 ,2 ,4 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Elect Informat & Elect Engn, Shanghai, Peoples R China
[2] Shanghai Qi Zhi Inst, Shanghai, Peoples R China
[3] Columbia Univ, Sch Engn & Appl Sci, New York, NY USA
[4] Shanghai Jiao Tong Univ, Al Inst, MoE Key Lab Artificial Intelligence, Shanghai, Peoples R China
基金
中国国家自然科学基金;
关键词
spiking neural network; gradient descent backpropagation; neuromorphic computing; spike-time-dependent plasticity; deep learning; efficient training; BACKPROPAGATION;
D O I
10.3389/fnins.2021.756876
中图分类号
Q189 [神经科学];
学科分类号
071006 ;
摘要
Spiking Neural Networks (SNNs) are a pathway that could potentially empower low-power event-driven neuromorphic hardware due to their spatio-temporal information processing capability and high biological plausibility. Although SNNs are currently more efficient than artificial neural networks (ANNs), they are not as accurate as ANNs. Error backpropagation is the most common method for directly training neural networks, promoting the prosperity of ANNs in various deep learning fields. However, since the signals transmitted in the SNN are non-differentiable discrete binary spike events, the activation function in the form of spikes presents difficulties for the gradient-based optimization algorithms to be directly applied in SNNs, leading to a performance gap (i.e., accuracy and latency) between SNNs and ANNs. This paper introduces a new learning algorithm, called SSTDP, which bridges the gap between backpropagation (BP)-based learning and spike-time-dependent plasticity (STDP)-based learning to train SNNs efficiently. The scheme incorporates the global optimization process from BP and the efficient weight update derived from STDP. It not only avoids the non-differentiable derivation in the BP process but also utilizes the local feature extraction property of STDP. Consequently, our method can lower the possibility of vanishing spikes in BP training and reduce the number of time steps to reduce network latency. In SSTDP, we employ temporal-based coding and use Integrate-and-Fire (IF) neuron as the neuron model to provide considerable computational benefits. Our experiments show the effectiveness of the proposed SSTDP learning algorithm on the SNN by achieving the best classification accuracy 99.3% on the Caltech 101 dataset, 98.1% on the MNIST dataset, and 91.3% on the CIFAR-10 dataset compared to other SNNs trained with other learning methods. It also surpasses the best inference accuracy of the directly trained SNN with 25 similar to 32x less inference latency. Moreover, we analyze event-based computations to demonstrate the efficacy of the SNN for inference operation in the spiking domain, and SSTDP methods can achieve 1.3 similar to 37.7x fewer addition operations per inference. The code is available at: https://github.com/MXHX7199/SNN-SSTDP.
引用
收藏
页数:15
相关论文
共 50 条
  • [41] Simonyan K, 2015, Arxiv, DOI arXiv:1409.1556
  • [42] STDP-based Unsupervised Feature Learning using Convolution-over-time in Spiking Neural Networks for Energy-Efficient Neuromorphic Computing
    Srinivasan, Gopalakrishnan
    Panda, Priyadarshini
    Roy, Kaushik
    [J]. ACM JOURNAL ON EMERGING TECHNOLOGIES IN COMPUTING SYSTEMS, 2018, 14 (04)
  • [43] A review of learning in biologically plausible spiking neural networks
    Taherkhani, Aboozar
    Belatreche, Ammar
    Li, Yuhua
    Cosma, Georgina
    Maguire, Liam P.
    McGinnity, T. M.
    [J]. NEURAL NETWORKS, 2020, 122 : 253 - 272
  • [44] BP-STDP: Approximating backpropagation using spike timing dependent plasticity
    Tavanaei, Amirhossein
    Maida, Anthony
    [J]. NEUROCOMPUTING, 2019, 330 : 39 - 47
  • [45] Wu H., 2021, P AAAI C ART INT VIR
  • [46] Wu JB, 2020, Arxiv, DOI arXiv:1907.01167
  • [47] Wu YJ, 2019, AAAI CONF ARTIF INTE, P1311
  • [48] Zhang L, 2019, AAAI CONF ARTIF INTE, P1319
  • [49] Zhang M., 2020, SPIKE TIMING DEPENDE
  • [50] Zhou S., 2019, 33 C INN APPL ART IN