MétaCan
Menu
Back to cohort

STDG: Fast and Lightweight SNN Training Technique Using Spike Temporal Locality

2023· article· en· W4390993409 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsYork UniversityUniversity of Toronto
Fundersnot available
KeywordsSpiking neural networkSpike (software development)MNIST databaseComputer scienceAsynchronous communicationNeuromorphic engineeringLocalityEfficient energy useArtificial intelligenceArtificial neural networkEnergy (signal processing)Face (sociological concept)Machine learningPattern recognition (psychology)Mathematics

Abstract

fetched live from OpenAlex

Spiking neural networks (SNNs) possess biological plausibility and energy efficiency as they communicate using asynchronous and mostly sparse spikes. These features make them an ideal choice for efficient neuromorphic computing. The non-differentiable, discrete binary spike events transmitted in SNNs pose a challenge for applying gradient-based optimization algorithms directly to these networks. Therefore, efficient techniques are necessary to enhance energy efficiency without sacrificing accuracy. In this work, we propose Spike Timing Dependent Gradient (STDG), a fast and lightweight learning scheme that uses temporal locality among spikes to avoid non-differentiable derivatives. Our experiments show that STDG reaches the state-of-the-art accuracy of 99.5% and 98.2% on the Caltech101 face/motorbike and the MNIST datasets, respectively.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.408
Threshold uncertainty score0.515

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.054
GPT teacher head0.275
Teacher spread0.221 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations1
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Memory and Neural ComputingFrench-language works237,207