Deep Gaussian Markov Random Fields for Graph-Structured Dynamical Systems
원문 초록
Probabilistic inference in high-dimensional state-space models is computationally challenging. For many spatiotemporal systems, however, prior knowledge about the dependency structure of state variables is available. We leverage this structure to develop a computationally efficient approach to state estimation and learning in graph-structured state-space models with (partially) unknown dynamics and limited historical data. Building on recent methods that combine ideas from deep learning with principled inference in Gaussian Markov random fields (GMRF), we reformulate graph-structured state-space models as Deep GMRFs defined by simple spatial and temporal graph layers. This results in a flexible spatiotemporal prior that can be learned efficiently from a single time sequence via variational inference. Under linear Gaussian assumptions, we retain a closed-form posterior, which can be sampled efficiently using the conjugate gradient method, scaling favourably compared to classical Kalman filter based approaches
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Efficient Transformed Gaussian Process State-Space Models for Non-Stationary High-Dimensional Dynamical Systems
Robust Filtering -- Novel Statistical Learning and Inference Algorithms with Applications
Learning Sequential Kinematic Models from Demonstrations for Multi-Jointed Articulated Objects
Statistical Linear Regression Approach to Kalman Filtering and Smoothing under Cyber-Attacks
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
Optimal Sensor Scheduling and Selection for Continuous-Discrete Kalman Filtering with Auxiliary Dynamics
토론
이 논문과 연결된 포럼 글이 아직 없습니다.