MétaCan
Menu
Back to cohort
Record W3184525714 · doi:10.1016/j.procs.2021.06.009

Dynamical properties of spiking neural networks with small world topologies

2021· article· en· W3184525714 on OpenAlexaff
Adam E. Bennett, Anthony S. White

Bibliographic record

VenueProcedia Computer Science · 2021
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsCarleton University
Fundersnot available
KeywordsNetwork topologySmall-world networkComputer scienceRandom graphSpiking neural networkTopology (electrical circuits)Artificial neural networkDissipative systemGraphComplex networkTheoretical computer scienceMathematicsArtificial intelligencePhysicsCombinatorics

Abstract

fetched live from OpenAlex

Spiking neural networks can exhibit complex firing regimes whose characteristics are influenced by network topology. This paper is part of an investigation into the dynamical properties of spiking neural networks generated with small world topologies in comparison to those generated with Erdos-Renyi random graphs. Specifically, the parameters for small world and random graph network topology generation are tested empirically to find values which give rise to stable (fixed or periodic) vs. unstable or dissipative firing patterns. Similar to Erdos-Renyi random graph topologies, a critical threshold was found where the parameters of small world network generation lead to stable rather than dissipative patterns. Optimal parameters are identified for both small world and Erdos-Renyi random graph topologies which allow for stable firing patterns with minimal synapses. These results suggest questions that will form the basis for further research into the effects of topology class on firing dynamics of spiking neural networks.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.001
Threshold uncertainty score0.002

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.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.025
GPT teacher head0.209
Teacher spread0.184 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations5
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueProcedia Computer ScienceSame topicAdvanced Memory and Neural ComputingFrench-language works237,207