mlsanityData to 7 Oct 2026

Spike-inspired Rank Coding for Fast and Accurate Recurrent Neural Networks

arXiv 2110.02865 ↗First posted 6 Oct 2021cs.NE cs.CV cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Biological spiking neural networks (SNNs) can temporally encode information in their outputs, e.g. in the rank order in which neurons fire, whereas artificial neural networks (ANNs) conventionally do not. As a result, models of SNNs for neuromorphic computing are regarded as potentially more rapid and efficient than ANNs when dealing with temporal input. On the other hand, ANNs are simpler to train, and usually achieve superior performance. Here we show that temporal coding such as rank coding (RC) inspired by SNNs can also be applied to conventional ANNs such as LSTMs, and leads to computational savings and speedups. In our RC for ANNs, we apply backpropagation through time using the standard real-valued activations, but only from a strategically early time step of each sequential input example, decided by a threshold-crossing event. Learning then incorporates naturally also *when* to produce an output, without other changes to the model or the algorithm. Both the forward and the backward training pass can be significantly shortened by skipping the remaining input sequence after that first event. RC-training also significantly reduces time-to-insight during inference, with a minimal decrease in accuracy. The desired speed-accuracy trade-off is tunable by varying the threshold or a regularization parameter that rewards output entropy. We demonstrate these in two toy problems of sequence classification, and in a temporally-encoded MNIST dataset where our RC model achieves 99.19% accuracy after the first input time-step, outperforming the state of the art in temporal coding with SNNs, as well as in spoken-word classification of Google Speech Commands, outperforming non-RC-trained early inference with LSTMs.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 19 of its 44 references that are in the map. First posted on arXiv 6 Oct 2021.

Builds on

19 of 44 references.

References · 19

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2014Going Deeper with Convolutionscited by 4,231
  3. 2015Convolutional LSTM Network: A Machine Learning Approach for Precipitation Nowcastingcited by 1,428
  4. 2018Speech Commands: A Dataset for Limited-Vocabulary Speech Recognitioncited by 741
  5. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
  6. 2017Spatio-Temporal Backpropagation for Training High-performance Spiking Neural Networkscited by 399
  7. 2018Long short-term memory and learning-to-learn in networks of spiking neuronscited by 179
  8. 2021PonderNet: Learning to Pondercited by 156
  9. 2021Accurate and efficient time-domain classification with adaptive spiking recurrent neural networkscited by 113
  10. 2017Hello Edge: Keyword Spotting on Microcontrollerscited by 108
  11. 2016Supervised learning based on temporal coding in spiking neural networkscited by 75
  12. 2021Adaptive Inference through Early-Exit Networks: Design, Challenges and Directionscited by 74
7 more
  1. 2019Fast and energy-efficient neuromorphic deep learning with first-spike timescited by 52
  2. 2019Temporal-Coded Deep Spiking Neural Network with Easy Training and Robust Performancecited by 45
  3. 2017Max-Pooling Loss Training of Long Short-Term Memory Networks for Small-Footprint Keyword Spottingcited by 15
  4. 2017Spiking neurons with short-term synaptic plasticity form superior generative networkscited by 6
  5. 2021Introducing "Neuromorphic Computing and Engineering"cited by 6
  6. 2021Spike time displacement based error backpropagation in convolutional spiking neural networkscited by 6
  7. 2020Optimality of short-term synaptic plasticity in modelling certain dynamic environmentscited by 4

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 2; 2024: 1; 2025: 1.

5 papers.