Spiking neural networks through the lens of streaming algorithms

DOI10.4230/LIPICS.DISC.2020.10MaRDI QIDQ6535007zbMATH OpenFDO

Authors Yael Hitron, Cameron Musco, M. Parter

Publication date 2 November 2023

zbMATH Keywords

streaming algorithmsspiking neural networksbiological distributed algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Distributed algorithms (68W15) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Recommendations

• Neuro-RAM unit with applications to similarity testing and compression in spiking neural networks
• On the Algorithmic Power of Spiking Neural Networks
• Spiking neural networks: model, learning algorithms and applications
• Evolving spiking neural networks for online learning over drifting data streams
• Lower Bounds for the Computational Power of Networks of Spiking Neurons

Cites work

• scientific article; zbMATH DE number 5763313 (Why is no real title available?)
• scientific article; zbMATH DE number 2019620 (Why is no real title available?)
• scientific article; zbMATH DE number 1559537 (Why is no real title available?)
• scientific article; zbMATH DE number 2086663 (Why is no real title available?)
• scientific article; zbMATH DE number 7559100 (Why is no real title available?)
• A neural algorithm for a fundamental computing problem
• An improved data stream summary: the count-min sketch and its applications
• Computational tradeoffs in biological neural networks: self-stabilizing winner-take-all networks
• Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons.
• Data streams: algorithms and applications.
• Fast and Space Efficient Spectral Sparsification in Dynamic Streams
• Hardness vs randomness
• K-median clustering, model-based compressive sensing, and sparse recovery for earth mover distance
• LogLog counting of large cardinalities (extended abstract)
• Neuro-RAM unit with applications to similarity testing and compression in spiking neural networks
• On the Algorithmic Power of Spiking Neural Networks
• Optimal space lower bounds for all frequency moments
• Random Sketching, Clustering, and Short-Term Memory in Spiking Neural Networks.
• Selection and sorting with limited storage
• Separations and equivalences between turnstile streaming and linear sketching
• Spike-Based Winner-Take-All Computation: Fundamental Limits and Order-Optimal Circuits
• Stable distributions, pseudorandom generators, embeddings, and data stream computation
• The Computational Cost of Asynchronous Neural Communication
• The space complexity of approximating the frequency moments
• Turnstile streaming algorithms might as well be linear sketches
• Universal classes of hash functions

Cited in

(1)

• A novel parallel merge neural network with streams of spiking neural network and artificial neural network

This page was built for publication: Spiking neural networks through the lens of streaming algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535007)