MétaCan
Menu
Retour à la cohorte
Enregistrement W2401944115

General Instruction Following in a Large-Scale Biologically Plausible Brain Model

2013· article· en· W2401944115 sur OpenAlexaffabout
Feng-Xuan Choo, Chris Eliasmith

Notice bibliographique

RevueCognitive Science · 2013
Typearticle
Langueen
DomaineNeuroscience
ThématiqueNeural dynamics and brain function
Établissements canadiensUniversity of Waterloo
Organismes subventionnairesnon disponible
Mots-clésSet (abstract data type)Computer scienceThalamusNeuroscienceBasal gangliaPsychologyProgramming language
DOInon disponible

Résumé

récupéré en direct d'OpenAlex

General Instruction Following in a Large-Scale Biologically Plausible Brain Model Xuan Choo (fchoo@uwaterloo.ca) Chris Eliasmith (celiasmith@uwaterloo.ca) Center for Theoretical Neuroscience, University of Waterloo Waterloo, ON, Canada N2L 3G1 Abstract Y”, “add 1 to the value in WM area X”). Apart from motor and cognitive commands, actions can also be utilized to change the values of the model’s states. Rules are conditional statements typically of the form “IF X, THEN Y” (e.g. “If you see a 1, then push button A”) where X is a set of conditions which have to be met for the set of actions Y to be executed. More generally, in Spaun, rules are statistical maps between cortical states and actions. An instruction is a combination of rules or actions that can be executed sequentially (e.g. “Remember the number 1; add 1 to that number; write the result”) or in any order (e.g. “If you see a 1, then push button A; If you see a 2, then push button B”). We present a spiking neuron brain model implemented in 318,870 LIF neurons organized with distinct cortical modules, a basal ganglia, and a thalamus, that is capable of flexibly fol- lowing memorized commands. Neural activity represents a structured set of rules, such as “If you see a 1, then push button A, and if you see a 2, then push button B”. Synaptic connec- tions between these neurons and the basal ganglia, thalamus, and other areas cause the system to detect when rules should be applied and to then do so. The model gives a reaction time difference of 77 ms between the simple and two-choice reac- tion time tasks, and requires 384 ms per item for sub-vocal counting, consistent with human experimental results. This is the first biologically realistic spiking neuron model capable of flexibly responding to complex structured instructions. Keywords: neural engineering; spiking neuron model; in- struction following; instruction processing; cognitive con- trol; cognitive architectures Spaun The architecture of Spaun (the Semantic Pointer Architecture, or SPA) is composed of 9 distinct but interconnected modules (see Figure 1A). Of interest to this paper is how the action selection module interacts with the rest of the model. Fun- damentally, the action selection module of Spaun is identical to the basal ganglia (BG) based production system described in (Stewart, Bekolay, & Eliasmith, 2012), and functions sim- ilarly to the action selection component of production system models (e.g. (Anderson, 1996)). In these systems, action selection is hard-coded by a pre- defined set of rules. To select an action, the BG monitors internal cortical state variables and executes a rule whose an- tecedent best matches the values of the internal state variables (see Figure 1B). Critically, to encode instructions, the tran- sitions between each rule in the instruction has to be hard- coded into the BG as well. For example, if the instruction was to perform ACTION-A followed by ACTION-B, and then ACTION-C, the following rules would have to be encoded into the BG: Introduction One of the hallmarks of complex cognition is the ability to perform a multitude of tasks using the same underlying ar- chitecture. When given an instruction, the human brain is capable of processing and executing the instruction without the need for extensive rewiring of the underlying neural con- nections. As far as we are aware, no neural model to date has been shown to exhibit this ability. Eliasmith et al. (2012) describes what is currently the world’s largest functional brain model. While the model, called Spaun (for Semantic Pointer Architecture Unified Net- work), is able to perform 8 different cognitive tasks with- out necessitating changes to its architecture, the knowledge needed to complete these 8 tasks is hard-coded into the ac- tion selection mechanism (the basal ganglia) of the model, making it unable to perform any task other than the prede- fined 8. In this paper, we propose an extension to the Spaun action selection component making it capable of processing generic instructions. IF INIT, THEN state = ACTION-A Terminology IF state = ACTION-A, THEN state = ACTION-B Four key concepts are discussed in this paper: states, actions, rules, and instructions. States are internal variables that the action selection sys- tem monitors to figure out what is the best action to perform. States can be both internal (e.g. goal memories, working memories (WM)) and external (e.g. visual input) to the sys- tem. Actions are atomic commands within the architecture, and are typically motor commands (e.g. “write the number X”, “push the X button”) or cognitive commands (e.g. “remember the word X”, “route information from WM area X to WM area IF state = ACTION-B, THEN state = ACTION-C Several ACT-R models (e.g. (Taatgen & Lee, 2003), (Taatgen, 1999)) able to follow instructions, however no neu- ral implementation has been previously discussed. Aside from its architecture, Spaun is also unique in the way information is represented. Information is encoded and rep- resented using semantic pointers (Eliasmith, In Press). These representations are used in the SPA to define a type of vec- tor symbolic architecture (VSA). In typical VSAs, the vector

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.

Comment cette classification a été obtenuedéplier

Prédiction distillée sur la base complète

Imitation des enseignants

Ni prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.

score de la tête « metaresearch » (Codex)0,000
score de la tête « metaresearch » (Gemma)0,001
Version: codex-gemma-dda1882f352aStatut de validation: machine_predicted_unvalidated
Catégories candidatesaucune
Catégories consensuellesaucune
DomaineSignal candidat: aucune · Signal consensuel: aucune
Devis d'étudeSignal candidat: Expérimental (laboratoire) · Signal consensuel: aucune
GenreSignal candidat: Empirique · Signal consensuel: Empirique
Score de désaccord entre enseignants0,908
Score d'incertitude au seuil0,415

Scores Codex et Gemma par catégorie

CatégorieCodexGemma
Métarecherche0,0000,001
Méta-épidémiologie (sens strict)0,0000,000
Méta-épidémiologie (sens large)0,0000,000
Bibliométrie0,0000,001
Études des sciences et des technologies0,0000,000
Communication savante0,0000,001
Science ouverte0,0000,000
Intégrité de la recherche0,0000,000
Charge utile insuffisante (le modèle a refusé de juger)0,0000,000

Scores machine (provisoires)

Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.

Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.

Tête enseignante Opus0,032
Tête enseignante GPT0,280
Écart entre enseignants0,248 · la distance entre les deux têtes enseignantes sur ce seul travail
Statut de validationscore_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle

Classification

machine, non validée

Prédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.

Les modèles n’ont appliqué aucune catégorie : rien dans la taxonomie ne correspondait à ce travail.
Devis d'étudeExpérimental (laboratoire)
Domainenon disponible
GenreEmpirique

Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».

En bref

Citations8
Publié2013
Routes d'admission2
Résumé présentoui

Explorer davantage

Même revueCognitive ScienceMême sujetNeural dynamics and brain functionTravaux en français237 207