2022
DOI: 10.48550/arxiv.2207.09384
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Scalable Spatio-Temporal Smoothing via Hierarchical Sparse Cholesky Decomposition

Abstract: We propose an approximation to the forward-filter-backward-sampler (FFBS) algorithm for large-scale spatio-temporal smoothing. FFBS is commonly used in Bayesian statistics when working with linear Gaussian state-space models, but it requires inverting covariance matrices which have the size of the latent state vector. The computational burden associated with this operation effectively prohibits its applications in high-dimensional settings. We propose a scalable spatio-temporal FFBS approach based on the hiera… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 27 publications
0
1
0
Order By: Relevance
“…algorithm. For recent reviews on Kalman filtering for spatio-temporal models seeFerreira et al (2022),Jurek and Katzfuss (2022a), andJurek and Katzfuss (2022b). The maximum likelihood estimates of the parameters are computed using the EM algorithm, which is implemented together with the parameter variance-covariance matrix computation in D-STEM packageWang et al (2021) for MATLAB.…”
mentioning
confidence: 99%
“…algorithm. For recent reviews on Kalman filtering for spatio-temporal models seeFerreira et al (2022),Jurek and Katzfuss (2022a), andJurek and Katzfuss (2022b). The maximum likelihood estimates of the parameters are computed using the EM algorithm, which is implemented together with the parameter variance-covariance matrix computation in D-STEM packageWang et al (2021) for MATLAB.…”
mentioning
confidence: 99%