Emulation‐based inference for spatial infectious disease transmission models incorporating event time uncertainty
Bibliographic record
Abstract
Abstract Mechanistic models of infectious disease spread are key to inferring spatiotemporal infectious disease transmission dynamics. Ideally, covariate data and the infection status of individuals over time would be used to parameterize such models. However, in reality, complete data are rarely available; for example, infection times are almost never observed. Bayesian data‐augmented Markov chain Monte Carlo (MCMC) methods are commonly used to allow us to infer such missing or censored data. However, for large disease systems, these methods can be highly computationally expensive. In this paper, we propose two methods of approximate inference for such situations based on so‐called emulation techniques. Here, both methods are set in a Bayesian MCMC framework but replace the computationally expensive likelihood function by a Gaussian process‐based likelihood approximation. In the first method, we build an emulator of the discrepancy between summary statistics of simulated and observed epidemic data. In the second method, we develop an emulator of an importance sampling‐based likelihood approximation. We show how both methods offer substantial computational efficiency gains over standard Bayesian MCMC‐based method, and can be used to infer the transmission of complex infectious disease systems. We also show that importance sampling‐based methods tend to perform more satisfactorily.
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.056 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".