
TL;DR
This paper explores the relationships between different Gaussian conditionally Markov models, providing methods to convert between models and establish equivalences, which enhances modeling flexibility in stochastic sequence analysis.
Contribution
It introduces a unified approach to derive algebraically equivalent models among various Gaussian CM, reciprocal, and Markov sequences, extending beyond previous restrictions on transition matrices.
Findings
Unified method for model conversion and equivalence
Extension to models with singular transition matrices
Backward Markov model derived from forward model
Abstract
The conditionally Markov (CM) sequence contains different classes, including Markov, reciprocal, and so-called and (two CM classes defined in our previous work). Markov sequences are special reciprocal sequences, and reciprocal sequences are special and sequences. Each class has its own forward and backward dynamic models. The evolution of a CM sequence can be described by different models. For a given problem, a model in a specific form is desired or needed, or one model can be easier to apply and better than another. Therefore, it is important to study the relationship between different models and to obtain one model from another. This paper studies this topic for models of nonsingular Gaussian (NG) , , reciprocal, and Markov sequences. Two models are \textit{probabilistically equivalent (PE)} if their stochastic sequences have the same…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTarget Tracking and Data Fusion in Sensor Networks · Time Series Analysis and Forecasting · Fault Detection and Control Systems
