MétaCan
Menu
Back to cohort
Record W2897559245 · doi:10.1109/ijcnn.2018.8489263

Digital Realization of PSTDP and TSTDP Learning

2018· article· en· W2897559245 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 institutionsUniversity of Windsor
Fundersnot available
KeywordsLookup tableField-programmable gate arrayComputer scienceElectronic circuitRealization (probability)Digital electronicsArtificial neural networkFinite-state machineTable (database)Computer engineeringComputer architectureAlgorithmComputer hardwareArtificial intelligenceMathematicsEngineeringElectrical engineering

Abstract

fetched live from OpenAlex

This paper presents low cost, accurate and configurable digital circuits for pair-based and triplet-based STDP learning models, and the proposed architectures are compared with the state of the art approaches such as Lookup table (LUT), and Piecewise Linear approximation (PWL). Experimental results and error measurements indicate a maximum error of 0.0088 between the proposed digital circuits and the original learning models. The circuits have been synthesized and physically implemented on Altera FPGA board. Synthesis results verify that the proposed circuits take maximum 1% of the FPGA resources. The circuits can be employed in a large scale Spiking Neural Network (SNN) implementation due to their compactness and configurability.

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.656
Threshold uncertainty score0.116

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.007
GPT teacher head0.207
Teacher spread0.201 · 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

Citations16
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Memory and Neural ComputingFrench-language works237,207