MétaCan
Menu
Back to cohort
Record W2510122185 · doi:10.1162/neco_a_00884

On the Analytical Solution of Firing Time for SpikeProp

2016· article· en· W2510122185 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

VenueNeural Computation · 2016
Typearticle
Languageen
FieldNeuroscience
TopicNeural dynamics and brain function
Canadian institutionsUniversité de MontréalCentre Hospitalier Universitaire Sainte-Justine
Fundersnot available
KeywordsConvergence (economics)BackpropagationComputer scienceEpoch (astronomy)Artificial neural networkReduction (mathematics)AlgorithmFunction (biology)Series (stratigraphy)Artificial intelligenceApplied mathematicsMathematics

Abstract

fetched live from OpenAlex

Error backpropagation in networks of spiking neurons (SpikeProp) shows promise for the supervised learning of temporal patterns. However, its widespread use is hindered by its computational load and occasional convergence failures. In this letter, we show that the neuronal firing time equation at the core of SpikeProp can be solved analytically using the Lambert W function, offering a marked reduction in execution time over the step-based method used in the literature. Applying this analytical method to SpikeProp, we find that training time per epoch can be reduced by 12% to 56% under different experimental conditions. Finally, this work opens the way for further investigations of SpikeProp's convergence behavior.

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.001
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.904
Threshold uncertainty score0.132

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
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.050
GPT teacher head0.283
Teacher spread0.233 · 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