MétaCan
Menu
Back to cohort
Record W2763455667 · doi:10.1109/ccta.2017.8062644

Kernel-based adaptive multiple model target tracking

2017· article· en· W2763455667 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

Venue2017 IEEE Conference on Control Technology and Applications (CCTA) · 2017
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsMcGill University
Fundersnot available
KeywordsRobustness (evolution)EstimatorAlgorithmIdentifiabilityComputer scienceKernel (algebra)Control theory (sociology)Artificial intelligenceMathematicsMachine learningStatistics

Abstract

fetched live from OpenAlex

The novel adaptive multiple-model target tracking algorithm presented here employs a non-asymptotic state and parameter estimator whose design hinges on a non-standard integral system representation. The same estimator can be used for target maneuver detection and isolation and hence constitutes the principal ingredient of the tracking algorithm. The algorithm does not maintain a model bank, but creates and identifies new models in an attempt to best track the measurement data. Such an approach is rendered uniquely possible by the fact that the state and parameter estimator is essentially dead-beat. Practical model identifiability, persistent excitation condition for the measured signal are discussed. Although this first version of the algorithm is deterministic and employs threshold-based maneuver detection, it exhibits good robustness with respect to Gaussian measurement noise.

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 categoriesMeta-epidemiology (narrow), Science and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.960
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.0020.001
Scholarly communication0.0000.000
Open science0.0020.000
Research integrity0.0000.001
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.045
GPT teacher head0.280
Teacher spread0.235 · 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