SearcharxivSearch

arXiv · 2605.29180

Neural Posterior Estimation for Spatial Individual-Level Epidemic Models

Abstract

Spatial individual-level models (ILMs) provide a flexible framework for modelling infectious disease transmission across populations with known locations. Bayesian inference for these models relies on Markov chain Monte Carlo (MCMC), which requires repeated likelihood evaluation and, when parts of the epidemic trajectory are unobserved, data-augmented sampling over high-dimensional latent variables. This computational cost limits the applicability of MCMC to large populations and to settings requiring inference across multiple outbreaks. We propose using neural posterior estimation (NPE) for amortised Bayesian inference in spatial ILMs. NPE trains a conditional normalising flow on simulated data to approximate the posterior directly, bypassing likelihood evaluation at inference time. We compare two embedding architectures: a convolutional neural network (CNN) operating on the population-level incidence curve and a graph neural network (GNN) operating on individual-level infection and location data. In a simulation study under full observation, stochastic removals, and partial observation, both variants produce well-calibrated posteriors, with the GNN embedding yielding lower error and narrower credible intervals for the spatial transmission parameters. We apply the framework to a spatial SEIR model on 1,177 farm locations from the 2001 UK foot-and-mouth disease outbreak. GNN-NPE maintains calibrated coverage and is substantially faster than MCMC on a per-epidemic basis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yicheng Mao, Rob Deardon. 2026-05-27. Neural Posterior Estimation for Spatial Individual-Level Epidemic Models. https://arxiv.org/abs/2605.29180

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO