Live demonstration: Efficient event-driven approach using synchrony processing for hardware spiking neural networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Recent neuromorphic applications now use spiking neural networks (SNNs) because of their improved computational power compared to previous generations of neural networks. Efficient simulation is essential when using this type of neuron since many events have to be handled on a large number of neurons within the network. In this demonstration, a hardware simulator for SNNs that has applications in image recognition is presented. This SNN uses synchrony processing for efficient event-driven simulation (SPEEDS) which allows parallel computations of synchronized events. SPEEDS differs from common event-driven approaches that serialize every event and can improve significantly the computational efficiency of a SNN simulator. The hardware SNN is implemented on a Xilinx Virtex-6 XC6VLX240T field-programmable gate array (FPGA) and can contain 131 072 neurons. It can process approximately 70 million spikes per second on a 4-bank architecture clocked at 100 MHz. The presentation explains how such a system can be used for image processing tasks like image segmentation, feature extraction and pattern matching to realize a recognition system that can detect several objects in a given image.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it