Quantifying Bayesian filter performance for turbulent dynamical systems through information theory
Bibliographic record
Abstract
Incomplete knowledge of the true dynamics and its partial observability pose a notoriously difficult problem in many scientific applications which require predictions of high-dimensional dynamical systems with instabilities and energy fluxes across a wide range of scales. In such cases assimilation of real data into the modeled dynamics is necessary for mitigating model error and for improving the stability and predictive skill of imperfect models. However, the practically implementable data assimilation/filtering strategies are also imperfect and not optimal due to the formidably complex nature of the underlying dynamics. Here, the connections between information theory and the filtering problem are exploited in order to establish bounds on the filter error statistics, and to systematically study the statistical accuracy of various Kalman filters with model error for estimating the dynamics of spatially extended, partially observed turbulent systems. The effects of model error on filter stability and accuracy in this high-dimensional setting are analyzed through appropriate information measures which naturally extend the common path-wise estimates of filter performance, like the mean-square error or pattern correlation, to the statistical superensemble setting that involves all possible initial conditions and all realizations of noisy observations of the truth signal. Particular emphasis is on the notion of practically achievable filter skill which requires trade-offs between different facets of filter performance; a new information criterion is introduced in this context. This information-theoretic framework for assessment of filter performance has natural generalizations to Kalman filtering with non-Gaussian statistically exactly solvable forecast models.
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.011 | 0.049 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".