MétaCan
Menu
Back to cohort
Record W2555477762 · doi:10.1109/ijcnn.2016.7727892

Robotic implementation of classical and Operant Conditioning as a single STDP learning process

2016· article· en· W2555477762 on OpenAlexaff
Etienne Dumesnil, Philippe-Olivier Beaulieu, Mounir Boukadoum

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsUniversité du Québec à Montréal
Fundersnot available
KeywordsOperant conditioningComputer scienceSpiking neural networkAdaptation (eye)Spike-timing-dependent plasticityProcess (computing)ConditioningField-programmable gate arrayArtificial intelligenceArtificial neural networkRobotKernel (algebra)Classical conditioningNeuroscienceEmbedded systemSynaptic plasticityEngineeringPsychology

Abstract

fetched live from OpenAlex

A robot is presented whose behavior is based on two fundamental types of learning in the animal world: Classical Conditioning (CC) and Operant Conditioning (OC). It is shown how both share Spike-Timing-Dependent-Plasticity (STDP) as learning process for a Spiking Neural Network (SNN). STDP was implemented on a Field-Programmable Gate Array (FPGA) with very low-demanding resources, using an adaptation of the Synapto-dendritic Kernel Adapting Neuron (SKAN) model. Moreover, it is shown how a 3-way version of STDP is needed to allow for OC. The robot was designed to use the CC and OC neuronal architectures proposed in this paper and was tested in a dynamic environment, which consisted of a maze with changing features. It was successful in presenting both types of learning. This paper thus validates an architecture with an important potential for very large scale time-dependent parallel data analysis, with high capacity of adaptation in a dynamic environment.

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.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

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.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.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.015
GPT teacher head0.283
Teacher spread0.269 · 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 designBench or experimental
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

Citations8
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Memory and Neural ComputingFrench-language works237,207