MétaCan
Menu
Back to cohort
Record W2403614030

Bidirectional Associative Memory for Short-term Memory Learning

2014· article· en· W2403614030 on OpenAlexfundno aff
Christopher Tremblay, Nareg Berberian, Sylvain Chartier

Bibliographic record

VenueeScholarship (California Digital Library) · 2014
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsConnectionismBidirectional associative memoryComputer scienceAssociative propertyArtificial neural networkContent-addressable memoryAssociative learningMemory modelArtificial intelligenceCategorizationExperimental psychologyCognitive scienceCognitionTerm (time)Cognitive psychologyPsychologyNeuroscience
DOInot available

Abstract

fetched live from OpenAlex

Previous research has shown that Bidirectional Associative Memories (BAM), a special type of artificial neural network, can perform various types of associations that human beings are able to perform with little effort.However, considering a simple association problem, such as associating faces with names, iterative type BAM networks usually take hundreds and sometimes thousands of learning trials to encode such associations correctly, whereas humans in some conditions learn much faster.The present study therefore proposes an adjustment to a particular type of BAM network that increases its performance in a rapid learning condition while processing memory capacity is limited.Results show that the modification to the original learning rule of the BHM leads to improved performance when rapid learning is required.Moreover, the model preserves its high memory load capacity in standard learning.This study could lead to improved cognitive models that can adapt their behavior in function of the contextual conditions.

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 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 categoriesScholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.735
Threshold uncertainty score1.000

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.0010.003
Open science0.0010.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.016
GPT teacher head0.230
Teacher spread0.214 · 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 teacher head, not a consensus.

Study designNot applicable
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

Citations3
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueeScholarship (California Digital Library)Same topicNeural Networks and ApplicationsFrench-language works237,207