ArticlePloS one2016
Supervised Learning in Spiking Neural Networks for Precise Temporal Encoding.
Article in PloS one, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 9 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
9 citing papers in PubMed.
- Beyond spiking networks: The computational advantages of dendritic amplification and input segregation.Proceedings of the National Academy of Sciences of the United States of America · 2023Article
- Error-based or target-based? A unified framework for learning in recurrent spiking networks.PLoS computational biology · 2022Article
- Target spike patterns enable efficient and biologically plausible learning for complex temporal tasks.PloS one · 2021Article
- Supervised Learning With First-to-Spike Decoding in Multilayer Spiking Neural Networks.Frontiers in computational neuroscience · 2021Article
- The covariance perceptron: A new paradigm for classification and processing of time series in recurrent neuronal networks.PLoS computational biology · 2020Article
- Pre-Synaptic Pool Modification (PSPM): A supervised learning procedure for recurrent spiking neural networks.PloS one · 2020Article
- Computing of temporal information in spiking neural networks with ReRAM synapses.Faraday discussions · 2019Article
- SuperSpike: Supervised Learning in Multilayer Spiking Neural Networks.Neural computation · 2018Article
- Predicting non-linear dynamics by stable local learning in a recurrent spiking neural network.eLife · 2017Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Precise spike timing as a means to encode information in neural networks is biologically supported, and is advantageous over frequency-based codes by processing input features on a much shorter time-scale. For these reasons, much recent attention has been focused on the development of supervised learning rules for spiking neural networks that utilise a temporal coding scheme. However, despite significant progress in this area, there still lack rules that have a theoretical basis, and yet can be considered biologically relevant. Here we examine the general conditions under which synaptic plasticity most effectively takes place to support the supervised learning of a precise temporal code. As part of our analysis we examine two spike-based learning methods: one of which relies on an instantaneous error signal to modify synaptic weights in a network (INST rule), and the other one relying on a filtered error signal for smoother synaptic weight modifications (FILT rule). We test the accuracy of the solutions provided by each rule with respect to their temporal encoding precision, and then measure the maximum number of input patterns they can learn to memorise using the precise timings of individual spikes as an indication of their storage capacity. Our results demonstrate the high performance of the FILT rule in most cases, underpinned by the rule's error-filtering mechanism, which is predicted to provide smooth convergence towards a desired solution during learning. We also find the FILT rule to be most efficient at performing input pattern memorisations, and most noticeably when patterns are identified using spikes with sub-millisecond temporal precision. In comparison with existing work, we determine the performance of the FILT rule to be consistent with that of the highly efficient E-learning Chronotron rule, but with the distinct advantage that our FILT rule is also implementable as an online method for increased biological realism.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.