Fast Convergence of Competitive Spiking Neural Networks with Sample-Based Weight Initialization

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Recent work on spiking neural networks showed good progress towards unsupervised feature learning. In particular, networks called Competitive Spiking Neural Networks (CSNN) achieve reasonable accuracy in classification tasks. However, two major disadvantages limit their practical applications: high computational complexity and slow convergence. While the first problem has partially been addressed with the development of neuromorphic hardware, no work has addressed the latter problem. In this paper we show that the number of samples the CSNN needs to converge can be reduced significantly by a proposed new weight initialization. The proposed method uses input samples as initial values for the connection weights. Surprisingly, this simple initialization reduces the number of training samples needed for convergence by an order of magnitude without loss of accuracy. We use the MNIST dataset to show that the method is robust even when not all classes are seen during initialization.

Cite

CITATION STYLE

APA

Cachi, P. G., Ventura, S., & Cios, K. J. (2020). Fast Convergence of Competitive Spiking Neural Networks with Sample-Based Weight Initialization. In Communications in Computer and Information Science (Vol. 1239 CCIS, pp. 773–786). Springer. https://doi.org/10.1007/978-3-030-50153-2_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free