State Space Model Programming in Turing.jl

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Hargreaves, Tim, Li, Qing, Knipp, Charles, Wantiez, Frederic, Godsill, Simon J., Ge, Hong
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916766229200896
author Hargreaves, Tim
Li, Qing
Knipp, Charles
Wantiez, Frederic
Godsill, Simon J.
Ge, Hong
author_facet Hargreaves, Tim
Li, Qing
Knipp, Charles
Wantiez, Frederic
Godsill, Simon J.
Ge, Hong
contents State space models (SSMs) are a powerful and widely-used class of probabilistic models for analysing time-series data across various fields, from econometrics to robotics. Despite their prevalence, existing software frameworks for SSMs often lack compositionality and scalability, hindering experimentation and making it difficult to leverage advanced inference techniques. This paper introduces SSMProblems.jl and GeneralisedFilters.jl, two Julia packages within the Turing.jl ecosystem, that address this challenge by providing a consistent, composable, and general framework for defining SSMs and performing inference on them. This unified interface allows researchers to easily define a wide range of SSMs and apply various inference algorithms, including Kalman filtering, particle filtering, and combinations thereof. By promoting code reuse and modularity, our packages reduce development time and improve the reliability of SSM implementations. We prioritise scalability through efficient memory management and GPU-acceleration, ensuring that our framework can handle large-scale inference tasks.
format Preprint
id arxiv_https___arxiv_org_abs_2505_23302
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle State Space Model Programming in Turing.jl
Hargreaves, Tim
Li, Qing
Knipp, Charles
Wantiez, Frederic
Godsill, Simon J.
Ge, Hong
Computation
State space models (SSMs) are a powerful and widely-used class of probabilistic models for analysing time-series data across various fields, from econometrics to robotics. Despite their prevalence, existing software frameworks for SSMs often lack compositionality and scalability, hindering experimentation and making it difficult to leverage advanced inference techniques. This paper introduces SSMProblems.jl and GeneralisedFilters.jl, two Julia packages within the Turing.jl ecosystem, that address this challenge by providing a consistent, composable, and general framework for defining SSMs and performing inference on them. This unified interface allows researchers to easily define a wide range of SSMs and apply various inference algorithms, including Kalman filtering, particle filtering, and combinations thereof. By promoting code reuse and modularity, our packages reduce development time and improve the reliability of SSM implementations. We prioritise scalability through efficient memory management and GPU-acceleration, ensuring that our framework can handle large-scale inference tasks.
title State Space Model Programming in Turing.jl
topic Computation
url https://arxiv.org/abs/2505.23302