Incremental inference of collective graphical models

2020/06/26 by Singh, Rahul, Haasler, Isabel, Zhang, Qinsheng +2
#FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Information Theory (cs.IT) #Machine Learning (cs.LG) #Machine Learning (stat.ML) #Optimization and Control (math.OC) #Systems and Control (eess.SY) #electronic engineering #information engineering

paper · doi:10.48550/arxiv.2006.15035

Abstract

We consider incremental inference problems from aggregate data for collective dynamics. In particular, we address the problem of estimating the aggregate marginals of a Markov chain from noisy aggregate observations in an incremental (online) fashion. We propose a sliding window Sinkhorn belief propagation (SW-SBP) algorithm that utilizes a sliding window filter of the most recent noisy aggregate observations along with encoded information from discarded observations. Our algorithm is built upon the recently proposed multi-marginal optimal transport based SBP algorithm that leverages standard belief propagation and Sinkhorn algorithm to solve inference problems from aggregate data. We demonstrate the performance of our algorithm on applications such as inferring population flow from aggregate observations.

Related

• Inference with Aggregate Data: An Optimal Transport Approach
• Inference of collective Gaussian hidden Markov models
• Gaussian Approximation of Collective Graphical Models
• Learning Hidden Markov Models from Aggregate Observations
• Filtering for Aggregate Hidden Markov Models with Continuous Observations