MétaCan
Menu
Back to cohort

Entropy-Driven Kalman Filter Model of Vision Training

2024· article· en· W4393406869 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
TopicInfrared Target Detection Methodologies
Canadian institutionsMcGill UniversityMontreal Neurological Institute and Hospital
Fundersnot available
KeywordsKalman filterArtificial intelligenceComputer scienceComputer visionEntropy (arrow of time)Extended Kalman filterEnsemble Kalman filterInvariant extended Kalman filterFast Kalman filterAlpha beta filterMoving horizon estimation

Abstract

fetched live from OpenAlex

In studies of vision training, subjects often are asked to identify specific stimuli over the course of many days. To make their decisions challenging, stimuli may be distorted in various ways. A successful training method would be one that extends, into generalization, performance gains made in training. We propose a special Kalman Filter model, that incorporates a Shannon-type entropy metric, "mutual information", as a way of comparing and deciding which vision training methods may be most successful in generalization. A key observation, based on our KF model and example images, is that including correlated noise in training stimuli may improve chances for a good generalization outcome. Future work will involve analyses of additional image sets and analytical support for, and comparisons to, experimental results.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.514
Threshold uncertainty score0.325

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.066
GPT teacher head0.292
Teacher spread0.226 · 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

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicInfrared Target Detection MethodologiesFrench-language works237,207