MétaCan
Menu
Back to cohort
Record W2017528090 · doi:10.1155/s1048953304311032

A deterministic discretisation‐step upper bound for state estimation via Clark transformations

2004· article· en· W2017528090 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 Stochastic Analysis · 2004
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsMathematicsUpper and lower boundsDiscretizationSmoothingApplied mathematicsState (computer science)A priori and a posterioriTransformation (genetics)Markov chainGridStability (learning theory)Markov processMathematical optimizationAlgorithmMathematical analysisStatisticsComputer scienceGeometry

Abstract

fetched live from OpenAlex

We consider the numerical stability of discretisation schemes for continuous‐time state estimation filters. The dynamical systems we consider model the indirect observation of a continuous‐time Markov chain. Two candidate observation models are studied. These models are (a) the observation of the state through a Brownian motion, and (b) the observation of the state through a Poisson process. It is shown that for robust filters (via Clark′s transformation), one can ensure nonnegative estimated probabilities by choosing a maximum grid step to be no greater than a given bound. The importance of this result is that one can choose an a priori grid step maximum ensuring nonnegative estimated probabilities. In contrast, no such upper bound is available for the standard approximation schemes. Further, this upper bound also applies to the corresponding robust smoothing scheme, in turn ensuring stability for smoothed state estimates.

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.820
Threshold uncertainty score0.506

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.009
GPT teacher head0.273
Teacher spread0.264 · 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