Conference item icon

Conference item

Approximate Bayesian computation with path signatures

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, and irregularly spaced sequences of non-iid data.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Publication website:
https://proceedings.mlr.press/v244/dyer24a.html

Authors

More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Oxford college:
St Hilda's College
Role:
Author
ORCID:
0000-0002-8304-8450


More from this funder
Funder identifier:
https://ror.org/0439y7842
Grant:
EP/W002949/1
EP/L015803/1


Publisher:
Proceedings of Machine Learning Research
Host title:
Proceedings of the 40th Conference on Uncertainty in Artificial Intelligence
Volume:
244
Pages:
1207-1231
Publication date:
2024-09-12
Acceptance date:
2024-04-26
Event title:
40th Conference on Uncertainty in Artificial Intelligence (UAI 2024)
Event location:
Barcelona, Spain
Event website:
https://www.auai.org/uai2024/
Event start date:
2024-07-15
Event end date:
2024-07-19
ISSN:
2640-3498


Language:
English
Pubs id:
2002849
Local pid:
pubs:2002849
Deposit date:
2024-06-03
ARK identifier:

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP