NCLGNEMLJun 14, 2017

Gradient Descent for Spiking Neural Networks

arXiv:1706.04698v2283 citations
AI Analysis

This provides a general-purpose supervised learning algorithm for spiking neural networks, advancing research in spike-based computation.

The authors tackled the lack of efficient supervised learning algorithms for spiking neural networks by developing a gradient descent method with exact gradient calculation, demonstrating successful training on dynamic tasks including a delayed memory XOR task over extended durations.

Much of studies on neural computation are based on network models of static neurons that produce analog output, despite the fact that information processing in the brain is predominantly carried out by dynamic neurons that produce discrete pulses called spikes. Research in spike-based computation has been impeded by the lack of efficient supervised learning algorithm for spiking networks. Here, we present a gradient descent method for optimizing spiking network models by introducing a differentiable formulation of spiking networks and deriving the exact gradient calculation. For demonstration, we trained recurrent spiking networks on two dynamic tasks: one that requires optimizing fast (~millisecond) spike-based interactions for efficient encoding of information, and a delayed memory XOR task over extended duration (~second). The results show that our method indeed optimizes the spiking network dynamics on the time scale of individual spikes as well as behavioral time scales. In conclusion, our result offers a general purpose supervised learning algorithm for spiking neural networks, thus advancing further investigations on spike-based computation.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes