paper-with-me

Papers

Learning Precise Spike Timings with Eligibility Traces

2020-05-08 · Manuel Traub, Martin V. Butz, R. Harald Baayen, Sebastian Otte

Recent research in the field of spiking neural networks (SNNs) has shown that recurrent variants of SNNs, namely long short-term SNNs (LSNNs), can be trained via error gradients just as effective as LSTMs. The underlying learning method (e-prop) is based on a formalization of eligibility traces applied to leaky integrate and fire (LIF) neurons. Here, we show that the proposed approach cannot fully unfold spike timing dependent plasticity (STDP). As a consequence, this limits in principle the inherent advantage of SNNs, that is, the potential to develop codes that rely on precise relative spike timings. We show that STDP-aware synaptic gradients naturally emerge within the eligibility equations of e-prop when derived for a slightly more complex spiking neuron model, here at the example of the Izhikevich model. We also present a simple extension of the LIF model that provides similar gradients. In a simple experiment we demonstrate that the STDP-aware LIF neurons can learn precise spike timings from an e-prop-based gradient signal.

📄 PDF Abstract BibTeX arXiv:2006.09988

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Learning From the Past with Cascading Eligibility Traces

2025-06-17 · Tokiniaina Raharison Ralambomihanta, Ivan Anokhin, Roman Pogodin, Samira Ebrahimi Kahou 외

Animals often receive information about errors and rewards after a significant delay. For example, there is typically a delay of tens to hundreds of milliseconds between motor actions and visual feedback. The standard ap…

Sensitivity Analysis for additive STDP rule

2015-02-28 · Subhajit Sengupta, Karthik S. Gurumoorthy, Arunava Banerjee

Spike Timing Dependent Plasticity (STDP) is a Hebbian like synaptic learning rule. The basis of STDP has strong experimental evidences and it depends on precise input and output spike timings. In this paper we show that …

Sensitivity

Investigating Recurrence and Eligibility Traces in Deep Q-Networks

2017-04-18 · Jean Harb, Doina Precup

Eligibility traces in reinforcement learning are used as a bias-variance trade-off and can often speed up training time by propagating knowledge back over time-steps in a single update. We investigate the use of eligibil…

Atari Gamesreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Adaptive and Multiple Time-scale Eligibility Traces for Online Deep Reinforcement Learning

2020-08-23 · Taisuke Kobayashi

Deep reinforcement learning (DRL) is one promising approach to teaching robots to perform complex tasks. Because methods that directly reuse the stored experience data cannot follow the change of the environment in robot…

Deep Reinforcement Learningreinforcement-learningReinforcement Learning (RL)

Guiding CTC Posterior Spike Timings for Improved Posterior Fusion and Knowledge Distillation

2019-04-17 · Gakuto Kurata, Kartik Audhkhasi

Conventional automatic speech recognition (ASR) systems trained from frame-level alignments can easily leverage posterior fusion to improve ASR accuracy and build a better single model with knowledge distillation. End-to…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Data AugmentationDecoder+5