arXiv:2111.13626
Hidden Markov Modeling over Graphs
원문 초록
This work proposes a multi-agent filtering algorithm over graphs for finite-state hidden Markov models (HMMs), which can be used for sequential state estimation or for tracking opinion formation over dynamic social networks. We show that the difference from the optimal centralized Bayesian solution is asymptotically bounded for geometrically ergodic transition models. Experiments illustrate the theoretical findings and in particular, demonstrate the superior performance of the proposed algorithm compared to a state-of-the-art social learning algorithm.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
From Models To Experiments: Shallow Recurrent Decoder Networks on the DYNASTY Experimental Facility
Recursive KalmanNet: Deep Learning-Augmented Kalman Filtering for State Estimation with Consistent Uncertainty Quantification
Benchmarking Spatiotemporal Reasoning in LLMs and Reasoning Models: Capabilities and Challenges
UMotion: Uncertainty-driven Human Motion Estimation from Inertial and Ultra-wideband Units
Contrastive Cross-Course Knowledge Tracing via Concept Graph Guided Knowledge Transfer
Secure Safety Filter Design for Sampled-data Nonlinear Systems under Sensor Spoofing Attacks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.