Abstract
We study distributed algorithms implemented in a simplified biologically inspired model for stochastic spiking neural networks. We focus on tradeoffs between computation time and network complexity, along with the role of noise and randomness in efficient neural computation. It is widely accepted that neural spike responses, and neural computation in general, is inherently stochastic. In recent work, we explored how this stochasticity could be leveraged to solve the 'winner-take-all' leader election task. Here, we focus on using randomness in neural algorithms for similarity testing and compression. In the most basic setting, given two n-length patterns of firing neurons, we wish to distinguish if the patterns are equal or ϵ-far from equal. Randomization allows us to solve this task with a very compact network, using O (√n log n/ϵ) auxiliary neurons, which is sublinear in the input size. At the heart of our solution is the design of a t-round neural random access memory, or indexing network, which we call a neuro-RAM. This module can be implemented with O(n/t) auxiliary neurons and is useful in many applications beyond similarity testing - e.g., we discuss its application to compression via random projection. Using a VC dimension-based argument, we show that the tradeoff between runtime and network size in our neuro-RAM is near optimal. To the best of our knowledge, we are the first to apply these techniques to stochastic spiking networks. Our result has several implications - since our neuro-RAM can be implemented with deterministic threshold gates, it shows that, in contrast to similarity testing, randomness does not provide significant computational advantages for this problem. It also establishes a separation between feedforward networks whose gates spike with sigmoidal probabilities, and well-studied deterministic sigmoidal networks, whose gates output real number sigmoidal values, and which can implement a neuro-RAM much more efficiently.
Original language | English |
---|---|
Title of host publication | 31st International Symposium on Distributed Computing, DISC 2017 |
Editors | Andrea W. Richa |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Pages | 33:1-33:16 |
ISBN (Electronic) | 9783959770538 |
DOIs | |
Publication status | Published - 12 Oct 2017 |
Event | 31st International Symposium on Distributed Computing, DISC 2017 - Vienna, Austria Duration: 16 Oct 2017 → 20 Oct 2017 |
Publication series
Series | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Volume | 91 |
ISSN | 1868-8969 |
Conference
Conference | 31st International Symposium on Distributed Computing, DISC 2017 |
---|---|
Country/Territory | Austria |
City | Vienna |
Period | 16/10/17 → 20/10/17 |
Funding
We thank Mohsen Ghaffari – the initial ideas regarding the importanace of the indexing module came up while Merav Parter was visiting him at ETH Zurich. We also thank Sergio Rajsbaum, Ron Rothblum, and Nir Shavit for helpful discussions. Publisher Copyright: © Nancy Lynch, Cameron Musco, and Merav Parter;.
All Science Journal Classification (ASJC) codes
- Software