• DocumentCode
    3496819
  • Title

    A forecast-based biologically-plausible STDP learning rule

  • Author

    Davies, Sergio ; Rast, Alexander ; Galluppi, Francesco ; Furber, Steve

  • Author_Institution
    Sch. of Comput. Sci., Univ. of Manchester, Manchester, UK
  • fYear
    2011
  • fDate
    July 31 2011-Aug. 5 2011
  • Firstpage
    1810
  • Lastpage
    1817
  • Abstract
    Spike Timing Dependent Plasticity (STDP) is a well known paradigm for learning in neural networks. In this paper we propose a new approach to this problem based on the standard STDP algorithm, with modifications and approximations, that relate the membrane potential with the LTP (Long Term Potentiation) part of the basic STDP rule. On the other side we use the standard STDP rule for the LTD (Long Term Depression) part of the algorithm. We show that on the basis of the membrane potential [5] it is possible to make a statistical prediction of the time needed by the neuron to reach the threshold, and therefore the LTP part of the STDP algorithm can be triggered when the neuron receives a spike.We present results that show the efficacy of this algorithm using one or more input patterns repeated over the whole time of the simulation. Through the approximations we suggest in this paper we introduce a learning rule that is easy to implement in simulators and reduces the execution time if compared with the standard STDP rule.
  • Keywords
    learning (artificial intelligence); neural nets; statistical analysis; forecast-based biologically-plausible STDP learning rule; long term potentiation; membrane potential; neural networks; spike timing dependent plasticity; standard STDP algorithm; standard STDP rule; statistical prediction; Approximation algorithms; Biological neural networks; Biological system modeling; Biomembranes; Computational modeling; Neurons;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks (IJCNN), The 2011 International Joint Conference on
  • Conference_Location
    San Jose, CA
  • ISSN
    2161-4393
  • Print_ISBN
    978-1-4244-9635-8
  • Type

    conf

  • DOI
    10.1109/IJCNN.2011.6033444
  • Filename
    6033444