REVIEW 2 cited by
Sparse Coding by Spiking Neural Networks: Convergence Theory and Computational Results
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Sparse Coding by Spiking Neural Networks: Convergence Theory and Computational Results
read the original abstract
In a spiking neural network (SNN), individual neurons operate autonomously and only communicate with other neurons sparingly and asynchronously via spike signals. These characteristics render a massively parallel hardware implementation of SNN a potentially powerful computer, albeit a non von Neumann one. But can one guarantee that a SNN computer solves some important problems reliably? In this paper, we formulate a mathematical model of one SNN that can be configured for a sparse coding problem for feature extraction. With a moderate but well-defined assumption, we prove that the SNN indeed solves sparse coding. To the best of our knowledge, this is the first rigorous result of this kind.
Forward citations
Cited by 2 Pith papers
-
Robust PnP on a Neuromorphic Processor for Object Pose Estimation
A robust PnP solver (NeuroPnP) is reformulated as an energy-minimization problem that runs on Intel Loihi 2, achieving roughly 1% of a CPU's power draw, with competitive accuracy in CPU simulation but lower accuracy o...
-
Generalization Bounds of Spiking Neural Networks via Rademacher Complexity
Spiking neural networks have Rademacher complexity bounds that scale exponentially with depth and spike sequence duration, superlinearly and subquadratically with width, polynomially with parameter norm, and inversely...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.