Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Legenstein, R.
Right arrow Articles by Maass, W.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Legenstein, R.
Right arrow Articles by Maass, W.
(Neural Computation. 2005;17:2337-2382.)
© 2005 The MIT Press


Letter

What Can a Neuron Learn with Spike-Timing-Dependent Plasticity?

Robert Legenstein

legi{at}igi.tugraz.at, Institute for Theoretical Computer Science, Technische Universitaet Graz, A-8010 Graz, Austria

Christian Naeger

naeger{at}gmx.de, Institute for Theoretical Computer Science, Technische Universitaet Graz, A-8010 Graz, Austria

Wolfgang Maass

maass{at}igi.tugraz.at, Institute for Theoretical Computer Science, Technische Universitaet Graz, A-8010 Graz, Austria

Spiking neurons are very flexible computational modules, which can implement with different values of their adjustable synaptic parameters an enormous variety of different transformations F from input spike trains to output spike trains. We examine in this letter the question to what extent a spiking neuron with biologically realistic models for dynamic synapses can be taught via spike-timing-dependent plasticity (STDP) to implement a given transformation F. We consider a supervised learning paradigm where during training, the output of the neuron is clamped to the target signal (teacher forcing). The well-known perceptron convergence theorem asserts the convergence of a simple supervised learning algorithm for drastically simplified neuron models (McCulloch-Pitts neurons). We show that in contrast to the perceptron convergence theorem, no theoretical guarantee can be given for the convergence of STDP with teacher forcing that holds for arbitrary input spike patterns. On the other hand, we prove that average case versions of the perceptron convergence theorem hold for STDP in the case of uncorrelated and correlated Poisson input spike trains and simple models for spiking neurons. For a wide class of cross-correlation functions of the input spike trains, the resulting necessary and sufficient condition can be formulated in terms of linear separability, analogously as the well-known condition of learnability by perceptrons. However, the linear separability criterion has to be applied here to the columns of the correlation matrix of the Poisson input. We demonstrate through extensive computer simulations that the theoretically predicted convergence of STDP with teacher forcing also holds for more realistic models for neurons, dynamic synapses, and more general input distributions. In addition, we show through computer simulations that these positive learning results hold not only for the common interpretation of STDP, where STDP changes the weights of synapses, but also for a more realistic interpretation suggested by experimental data where STDP modulates the initial release probability of dynamic synapses.




This article has been cited by other articles:


Home page
J. Neurophysiol.Home page
M. A. Farries and A. L. Fairhall
Reinforcement Learning With Modulated Spike Timing Dependent Synaptic Plasticity
J Neurophysiol, December 1, 2007; 98(6): 3648 - 3665.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
J. M. Brader, W. Senn, and S. Fusi
Learning Real-World Stimuli in a Neural Network with Spike-Driven Synaptic Dynamics
Neural Comput., November 1, 2007; 19(11): 2881 - 2912.
[Abstract] [Full Text] [PDF]


Home page
Cereb CortexHome page
B. Tripp and C. Eliasmith
Neural Populations Can Induce Reliable Postsynaptic Currents without Observable Spike Rate Changes or Precise Spike Timing
Cereb Cortex, August 1, 2007; 17(8): 1830 - 1840.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
R. V. Florian
Reinforcement Learning Through Modulation of Spike-Timing-Dependent Synaptic Plasticity
Neural Comput., June 1, 2007; 19(6): 1468 - 1502.
[Abstract] [Full Text] [PDF]


Home page
J. Neurosci.Home page
J. A. Mossbridge, M. B. Fitzgerald, E. S. O'Connor, and B. A. Wright
Perceptual-Learning Evidence for Separate Processing of Asynchrony and Order Tasks
J. Neurosci., December 6, 2006; 26(49): 12708 - 12716.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
J.-P. Pfister, T. Toyoizumi, D. Barber, and W. Gerstner
Optimal spike-timing-dependent plasticity for precise action potential firing in supervised learning.
Neural Comput., June 1, 2006; 18(6): 1318 - 1348.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2005 by The MIT Press.