Comment on “Autorepar: A Method to Obtain Identifiable and Observable Reparameterizations of Dynamic Models With Mechanistic Insights”: Existence of an Identifiable Reparameterization
Bibliographic record
Abstract
ABSTRACT When a parameterized dynamical system is not (structurally locally) identifiable, it is crucial to reparameterize the system to ensure that the new parameters can be uniquely determined, at least locally. In the article Massonis et al. (2021), Theorem 2 (also presented in Gunn et al. (1997) as Theorem 1) claims the existence of an identifiable reparameterization for a parameterized analytic function. We first give a counter‐example to show that its conditions are indeed incomplete. Consequently, to address its incompleteness, we will propose a modified version of the theorem.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.016 | 0.065 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.004 | 0.013 |
| Scholarly communication | 0.003 | 0.007 |
| Open science | 0.007 | 0.004 |
| Research integrity | 0.020 | 0.025 |
| Insufficient payload (model declined to judge) | 0.008 | 0.004 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".