Efficient Bayesian Filtering and Inference for Integro-Difference Equation Models

Abstract

Integro-Difference Equation (IDE) models are a class of dynamic spatio-temporal models which describe the temporal evolution of a spatial process, usually to model advection and diffusion of some random field over time. While several papers have focused on inference and performance of these models, little attention has been given to computational comparisons of various methods of computing posterior densities and performing inference. We address this problem in two parts. Firstly, in inference for these models, Kalman filtering (and smoothing) is often used; either to compute marginal likelihoods, or to sample from the hidden process conditional on the rest of the parameters of the model. There are many variations of the Kalman filter and smoother with substantially varying performance profiles and stability: the standard Kalman filter, its square-root form, its information form, to name a few. The information filters, when set up correctly, can compute the likelihood in 𝒪(nr² + r³) time per time point (n being the number of observations per time point), where the computation in n can be done in parallel, on models with independent observation error. In this paper, we analyse these forms in the context of IDEs, considering computational speed and stability. Secondly, there are two main methods of inference used for the kind of dynamical system that IDEs can be reduced to; directly using the marginal likelihood without the hidden state, or constructing a block Gibbs sampler with the hidden state. We compare these two approaches in terms of computational efficiency and practical performance in the IDE setting. Using a block Gibbs sampler for inference on the system parameters proves to be more efficient in most cases, with a specific real-data example providing an exception.

Efficient Bayesian inference for multiple network data
Francesco Barile, Sara Capozio, Bernardo Nipoti
arXiv1 Oct 2026PreprintarXiv licenceFull textStatisticsarXiv
Econometric Inference for Regularized Riemann-Liouville Fractional Brownian Motion Second-Order Filtering, HAC-GMM, and Weak Identification
Jules Sadefo Kamdem
HAL19 Jun 2026PreprintCC BY 4.0Full textStatistics Statistical & nonlinear physicsHAL
Regularity-informed data assimilation: A hierarchical Bayesian approach to ensemble Kalman filtering for hyperbolic conservation laws
Jan Glaubitz, Daniel Sharp, Mathieu le Provost +1
arXiv2 Sep 2026PreprintCC BY-SA 4.0Full textNumerical analysis & scientific computing StatisticsarXiv
Deep Bayesian Filtering for Nonlinear Structural System Identification: A Tutorial on Structural and Physical Inductive Biases
Wei Liu, Konstantinos Vlachas, Eleni Chatzi
arXiv29 Oct 2026PreprintCC BY 4.0Full textStatisticsarXiv
On convergence of formal Dulac series, satisfying an algebraic q-difference equation
Nikita V. Gaianov, Anastasia V. Parusnikova
arXiv25 Sep 2026PreprintarXiv licenceFull textAnalysis & PDEsarXiv

Cite

BibTeX RIS

BibTeX

@misc{hughes2026efficient,
  title = {{Efficient Bayesian Filtering and Inference for Integro-Difference Equation Models}},
  author = {Evan Tate Paterson Hughes and Darren J. Wilkinson and Louis Aslett},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.28170},
  eprint = {2610.28170},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.28170},
}

RIS

TY  - UNPB
TI  - Efficient Bayesian Filtering and Inference for Integro-Difference Equation Models
AU  - Evan Tate Paterson Hughes
AU  - Darren J. Wilkinson
AU  - Louis Aslett
PY  - 2026
DA  - 2026/10/20
PB  - arXiv
DO  - 10.48550/arxiv.2610.28170
UR  - https://arxiv.org/abs/2610.28170
AB  - Integro-Difference Equation (IDE) models are a class of dynamic spatio-temporal models which describe the temporal evolution of a spatial process, usually to model advection and diffusion of some random field over time. While several papers have focused on inference and performance of these models, little attention has been given to computational comparisons of various methods of computing posterior densities and performing inference. We address this problem in two parts. Firstly, in inference for these models, Kalman filtering (and smoothing) is often used; either to compute marginal likelihoods, or to sample from the hidden process conditional on the rest of the parameters of the model. There are many variations of the Kalman filter and smoother with substantially varying performance profiles and stability: the standard Kalman filter, its square-root form, its information form, to name a few. The information filters, when set up correctly, can compute the likelihood in 𝒪(nr^2 + r^3) time per time point (n being the number of observations per time point), where the computation in n can be done in parallel, on models with independent observation error. In this paper, we analyse these forms in the context of IDEs, considering computational speed and stability. Secondly, there are two main methods of inference used for the kind of dynamical system that IDEs can be reduced to; directly using the marginal likelihood without the hidden state, or constructing a block Gibbs sampler with the hidden state. We compare these two approaches in terms of computational efficiency and practical performance in the IDE setting. Using a block Gibbs sampler for inference on the system parameters proves to be more efficient in most cases, with a specific real-data example providing an exception.
ER  -

Abstract

Related

Cite