MétaCan
Menu
Back to cohort
Record W4392736895 · doi:10.1109/lcsys.2024.3416238

Extending Identifiability Results From Continuous to Discrete-Space Systems

2024· preprint· en· W4392736895 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 Control Systems Letters · 2024
Typepreprint
Languageen
FieldComputer Science
TopicComputability, Logic, AI Algorithms
Canadian institutionsBrock University
Fundersnot available
KeywordsIdentifiabilitySpace (punctuation)Computer scienceDiscrete spaceMathematicsTopology (electrical circuits)Mathematical analysisCombinatorics

Abstract

fetched live from OpenAlex

Researchers develop models to explain the unknowns. These models typically involve parameters that capture tangible quantities, the estimation of which is desired. Parameter identifiability investigates the recoverability of the unknown parameters given the error-free outputs, inputs, and the developed equations of the model. Different notions of and methods to test identifiability exist for dynamical systems defined in the continuous space. Yet little attention was paid to the identifiability of discrete space systems, where variables and parameters are defined in a discrete space. We develop the identifiability framework for discrete space systems and highlight that this is not an immediate extension of the continuous space framework. Unlike the continuous case, local identifiability concepts are sensitive to how a “neighborhood” is defined. Moreover, results on algebraic identifiability that proved useful in the continuous space are less so in their discrete form as the notion of differentiability disappears.

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.005
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication, Open science
Consensus categoriesMeta-epidemiology (narrow)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.884
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.001
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0030.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0060.000
Open science0.0060.004
Research integrity0.0010.002
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.016
GPT teacher head0.252
Teacher spread0.236 · 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