MétaCan
Menu
Back to cohort
Record W2575983518 · doi:10.1002/rnc.3744

Continuous‐time Kalman filtering on the orthogonal group <i>O(n)</i>

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

VenueInternational Journal of Robust and Nonlinear Control · 2017
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsMcGill UniversityToronto Metropolitan University
Fundersnot available
KeywordsKalman filterOrthonormal basisExtended Kalman filterControl theory (sociology)Fast Kalman filterInvariant extended Kalman filterMathematicsGroup (periodic table)Alpha beta filterUnscented transformComputer scienceMoving horizon estimationPhysicsArtificial intelligence

Abstract

fetched live from OpenAlex

Summary This paper presents a continuous‐time O ( n )‐constrained Kalman‐like filter. O ( n ) is the group of n × n orthonormal matrices. The O ( n )‐constrained Kalman‐like filter is derived by posing a constrained optimization problem. The solution involves a projection of the unconstrained Kalman state estimate derivative onto the tangent space of O ( n ). Using this filter, an extended O ( n )‐constrained Kalman‐like filter is developed for nonlinear systems where a portion of the states evolve on O ( n ). A numerical example demonstrates the effectiveness of the extended O ( n )‐constrained Kalman‐like filter. Copyright © 2017 John Wiley &amp; Sons, Ltd.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.000
Open science0.0020.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.015
GPT teacher head0.240
Teacher spread0.225 · 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