{"title":"SpikeProp算法中基于时间关联的便利突触并行组合","authors":"Shushi Liu, Chuandong Li","doi":"10.1109/ICCSS53909.2021.9721950","DOIUrl":null,"url":null,"abstract":"This paper presents a new method to minimize the error function between the expected spike time and the actual spike time, which is a parallel combination of facilitating synapses consisting of an excitatory and an inhibitory synapse. The SpikeProp algorithm is designed to solve the error optimization problem between the expected spike time and the actual spike time of the current from the presynaptic neuron passing through the synapse to the postsynaptic neuron. The SpikeProp algorithm merges the Bienenstock–Cooper–Munro (BCM) rule with Spike Timing Dependent Plasticity (STDP) before calculating errors. The idea of filtration based on value in Synaptic Weight Association Training (SWAT) is utilized in the hidden layer. Thus, a time selector is used in the synapse between the input layer and the hidden layer, which is achieved through parallel combination of excitatory and inhibitory synapses. The neuron models used in these two processes are Leaky Integrate and Fired (LIF) and Spike Response Model (SRM), respectively. The algorithm is benchmarked against the nonlinear exclusive OR (XOR) problem. The simulation results has illustrated the diagram of the time selector in the hidden layer and the error measured in the output layer.","PeriodicalId":435816,"journal":{"name":"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Parallel Combination of Facilitating Synapse Based on Temporal Correlation in SpikeProp Algorithm\",\"authors\":\"Shushi Liu, Chuandong Li\",\"doi\":\"10.1109/ICCSS53909.2021.9721950\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new method to minimize the error function between the expected spike time and the actual spike time, which is a parallel combination of facilitating synapses consisting of an excitatory and an inhibitory synapse. The SpikeProp algorithm is designed to solve the error optimization problem between the expected spike time and the actual spike time of the current from the presynaptic neuron passing through the synapse to the postsynaptic neuron. The SpikeProp algorithm merges the Bienenstock–Cooper–Munro (BCM) rule with Spike Timing Dependent Plasticity (STDP) before calculating errors. The idea of filtration based on value in Synaptic Weight Association Training (SWAT) is utilized in the hidden layer. Thus, a time selector is used in the synapse between the input layer and the hidden layer, which is achieved through parallel combination of excitatory and inhibitory synapses. The neuron models used in these two processes are Leaky Integrate and Fired (LIF) and Spike Response Model (SRM), respectively. The algorithm is benchmarked against the nonlinear exclusive OR (XOR) problem. The simulation results has illustrated the diagram of the time selector in the hidden layer and the error measured in the output layer.\",\"PeriodicalId\":435816,\"journal\":{\"name\":\"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSS53909.2021.9721950\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 8th International Conference on Information, Cybernetics, and Computational Social Systems (ICCSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSS53909.2021.9721950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本文提出了一种最小化预期尖峰时间与实际尖峰时间之间误差函数的新方法,该方法是由兴奋性突触和抑制性突触组成的便利突触并行组合。SpikeProp算法旨在解决从突触前神经元到突触后神经元的电流的预期尖峰时间与实际尖峰时间之间的误差优化问题。SpikeProp算法在计算误差之前,将bienenstock - copper - munro (BCM)规则与Spike Timing Dependent Plasticity (STDP)相结合。隐层采用了突触权重关联训练(SWAT)中基于值的过滤思想。因此,在输入层和隐藏层之间的突触中使用时间选择器,这是通过兴奋性突触和抑制性突触的并行组合来实现的。在这两个过程中使用的神经元模型分别是Leaky Integrate and Fired (LIF)和Spike Response Model (SRM)。该算法针对非线性异或问题进行了基准测试。仿真结果显示了隐层时间选择器的框图和输出层测量的误差。
A Parallel Combination of Facilitating Synapse Based on Temporal Correlation in SpikeProp Algorithm
This paper presents a new method to minimize the error function between the expected spike time and the actual spike time, which is a parallel combination of facilitating synapses consisting of an excitatory and an inhibitory synapse. The SpikeProp algorithm is designed to solve the error optimization problem between the expected spike time and the actual spike time of the current from the presynaptic neuron passing through the synapse to the postsynaptic neuron. The SpikeProp algorithm merges the Bienenstock–Cooper–Munro (BCM) rule with Spike Timing Dependent Plasticity (STDP) before calculating errors. The idea of filtration based on value in Synaptic Weight Association Training (SWAT) is utilized in the hidden layer. Thus, a time selector is used in the synapse between the input layer and the hidden layer, which is achieved through parallel combination of excitatory and inhibitory synapses. The neuron models used in these two processes are Leaky Integrate and Fired (LIF) and Spike Response Model (SRM), respectively. The algorithm is benchmarked against the nonlinear exclusive OR (XOR) problem. The simulation results has illustrated the diagram of the time selector in the hidden layer and the error measured in the output layer.