MétaCan
Menu
Back to cohort
Record W2590500368 · doi:10.1109/icci-cc.2016.7862055

Robotic implementation of classical and operant conditioning within a single SNN architecture

2016· article· en· W2590500368 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 conditioningSpiking neural networkComputer scienceClassical conditioningAdaptation (eye)Spike-timing-dependent plasticityArtificial intelligenceArtificial neural networkSpike (software development)ConditioningKernel (algebra)NeuroscienceSynaptic plasticityPsychologyMathematics

Abstract

fetched live from OpenAlex

This work presents the implementation of operant conditioning (OC) and classical conditioning (CC) with a single spiking neural network (SNN) architecture, thus suggesting that the two types of leaning may relate to the same cognitive process. Both are achieved by using a modified version of spike-timing-dependent plasticity (STDP), where the connection weight between a cue neuron and an action neuron depends on the temporal relation between their spikes and those of a reward neuron. This reward driven STDP (RD-STDP) was implemented with simple computational resources to form an electronic robot's brain, using an adaptation of the synapto-dendritic kernel adapting neuron (SKAN) model. Then, a robot driven by the new neuronal architecture was tested in a maze with changing features, successfully exhibiting CC and OC. These results and the simple computational resources used make the proposed architecture promising for very large scale time-dependent parallel data analysis, with high capacity of adaptation in a dynamic environment. Moreover, it proposes a theoretic framework to model learning by conditioning.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.005

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.251
Teacher spread0.237 · 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

Citations1
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Memory and Neural ComputingFrench-language works237,207