This program is tentative and subject to change.
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.
Extended abstract (SSM Programming in Turing.jl.pdf) | 1.59MiB |
This program is tentative and subject to change.
Sun 19 JanDisplayed time zone: Mountain Time (US & Canada) change
16:00 - 17:30 | |||
16:00 15mTalk | Partially Evaluating Higher-Order Probabilistic Programs without Stochastic Recursion to Graphical Models (Remote) LAFI | ||
16:16 15mTalk | State Space Model Programming in Turing.jl LAFI Tim Hargreaves Department of Engineering, University of Cambridge, Qing Li Department of Engineering, University of Cambridge, Charles Knipp Federal Reserve Board of Governors, USA, Frederic Wantiez , Simon J. Godsill Department of Engineering, University of Cambridge, Hong Ge University of Cambridge File Attached | ||
16:32 55mOther | Poster session LAFI | ||
17:28 2mDay closing | Closing remarks LAFI Atılım Güneş Baydin University of Oxford |