A Basic Compositional Model for Spiking Neural Networks
Nancy Lynch, Cameron Musco

TL;DR
This paper develops a formal mathematical framework for modeling and reasoning about the behavior of synchronous, stochastic Spiking Neural Networks using concurrency theory paradigms, including composition and hiding operators.
Contribution
It introduces a formal SNN model with operators for composition and hiding, and analyzes how these affect external behavior and problem-solving capabilities.
Findings
Defined external behavior in probabilistic terms
Proved relationships between component and composite networks
Illustrated with examples including circuits and attention networks
Abstract
We present a formal, mathematical foundation for modeling and reasoning about the behavior of , , which have been widely used in studies of neural computation. Our approach follows paradigms established in the field of concurrency theory. Our SNN model is based on directed graphs of neurons, classified as input, output, and internal neurons. We focus here on basic SNNs, in which a neuron's only state is a Boolean value indicating whether or not the neuron is currently firing. We also define the of an SNN, in terms of probability distributions on its external firing patterns. We define two operators on SNNs: a , which supports modeling of SNNs as combinations of smaller SNNs, and a , which reclassifies some output behavior of an SNN as internal. We prove…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
