Stochastic Computing Can Improve Upon Digital 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
With the surge in popularity of machine learning algorithms, research has turned towards exploring novel computing architectures in order to increase performance while limiting power consumption. Inspired by their biological counterparts, digital spiking neural networks have emerged as energy efficient alternatives to conventional hardware implementations, yet remain largely incompatible with cutting edge learning methods. Representing information with single-bit binary pulse trains, the behaviour of spiking neural networks exhibit many interesting analogues to the existing field of stochastic computing. In this paper, we not only illustrate the parallels between digital spiking neural networks and stochastic computing, but we also demonstrate that many computing elements in modern spiking hardware are, in fact, implementations of stochastic circuits. In addition, we show that stochastic computing design techniques can be leveraged in order to address shortcomings in current spiking neural network architectures.
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