MétaCan
Menu
Back to cohort
Record W2338595933 · doi:10.1109/tac.2016.2557999

Linear Optimal Unbiased Filter for Time-Variant Systems Without Apriori Information on Initial Conditions

2016· article· en· W2338595933 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

VenueIEEE Transactions on Automatic Control · 2016
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsMinistry of Education and Child CareUniversity of Alberta
Fundersnot available
KeywordsKalman filterA priori and a posterioriMathematicsRealization (probability)Control theory (sociology)ComputationFilter (signal processing)State (computer science)Transient (computer programming)Mathematical optimizationComputer scienceAlgorithmStatisticsArtificial intelligenceControl (management)

Abstract

fetched live from OpenAlex

In this technical note, an optimal unbiased filter (OUF) is derived for time-variant systems to relax the initial condition assumption in Kalman filter (KF). By minimizing the mean square errors subject to the unbiasedness condition a solution is derived in a batch computation form first. To facilitate the on-line application, a recursive realization is further developed. The effect of removing the initial condition assumption on the estimation performance is analysed, and we show that the proposed algorithm converges to the KF asymptotically. Two-state harmonic model and four-state moving target tracking model are employed to demonstrate that the OUF can improve transient estimation performance significantly and can be used in place of the KF when the apriori information about the initial state values is not available.

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 categoriesInsufficient payload (model declined to judge)
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.981
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.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

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.014
GPT teacher head0.255
Teacher spread0.241 · 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