English

Approximate Bayesian Computation with Path Signatures

Methodology 2023-02-02 v2 Computation Machine Learning

Abstract

Simulation models often lack tractable likelihood functions, making likelihood-free inference methods indispensable. Approximate Bayesian computation generates likelihood-free posterior samples by comparing simulated and observed data through some distance measure, but existing approaches are often poorly suited to time series simulators, for example due to an independent and identically distributed data assumption. In this paper, we propose to use path signatures in approximate Bayesian computation to handle the sequential nature of time series. We provide theoretical guarantees on the resultant posteriors and demonstrate competitive Bayesian parameter inference for simulators generating univariate, multivariate, irregularly spaced, and even non-Euclidean sequences.

Keywords

Cite

@article{arxiv.2106.12555,
  title  = {Approximate Bayesian Computation with Path Signatures},
  author = {Joel Dyer and Patrick Cannon and Sebastian M Schmon},
  journal= {arXiv preprint arXiv:2106.12555},
  year   = {2023}
}

Comments

42 pages, 8 figures

R2 v1 2026-06-24T03:31:29.113Z