How Not to Make the Joint Extended Kalman Filter Fail with Unstructured Mechanistic Models
Bibliographic record
Abstract
The unstructured mechanistic model (UMM) allows for modeling the macro-scale of a phenomenon without known mechanisms. This is extremely useful in biomanufacturing because using the UMM for the joint estimation of states and parameters with an extended Kalman filter (JEKF) can enable the real-time monitoring of bioprocesses with unknown mechanisms. However, the UMM commonly used in biomanufacturing contains ordinary differential equations (ODEs) with unshared parameters, weak variables, and weak terms. When such a UMM is coupled with an initial state error covariance matrix P(t=0) and a process error covariance matrix Q with uncorrelated elements, along with just one measured state variable, the joint extended Kalman filter (JEKF) fails to estimate the unshared parameters and state simultaneously. This is because the Kalman gain corresponding to the unshared parameter remains constant and equal to zero. In this work, we formally describe this failure case, present the proof of JEKF failure, and propose an approach called SANTO to side-step this failure case. The SANTO approach consists of adding a quantity to the state error covariance between the measured state variable and unshared parameter in the initial P(t = 0) of the matrix Ricatti differential equation to compute the predicted error covariance matrix of the state and prevent the Kalman gain from being zero. Our empirical evaluations using synthetic and real datasets reveal significant improvements: SANTO achieved a reduction in root-mean-square percentage error (RMSPE) of up to approximately 17% compared to the classical JEKF, indicating a substantial enhancement in estimation accuracy.
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.008 | 0.052 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.003 | 0.007 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.004 | 0.005 |
| Insufficient payload (model declined to judge) | 0.004 | 0.002 |
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".