On Training Spiking Neural Networks by Means of a Novel Quantum Inspired Machine Learning Method
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
ABSTRACT In spite of the high potential shown by spiking neural networks (e.g., temporal patterns), training them remains an open and complex problem. In practice, while in theory these networks are computationally as powerful as mainstream artificial neural networks, they have not reached the same accuracy levels yet. The major reason for such a situation seems to be represented by the lack of adequate training algorithms for deep spiking neural networks, since spike signals are not differentiable, that is, no direct way to compute a gradient is provided. Recently, a novel training method, based on the (digital) simulation of certain quantum systems, has been suggested. It has already shown interesting advantages, among which is the fact that no gradient is required to be computed. In this work, we apply this approach to the problem of training spiking neural networks, and we show that this recent training method is capable of training deep and complex spiking neural networks on the MNIST data set.
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.001 |
| 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