Non-approximate Inference for Collective Graphical Models on Path Graphs via Discrete Difference of Convex Algorithm
Yasunori Akagi, Naoki Marumo, Hideaki Kim, Takeshi Kurashima and, Hiroyuki Toda

TL;DR
This paper introduces a novel exact MAP inference method for Collective Graphical Models on path graphs, utilizing a difference of convex algorithm to improve solution quality over approximate methods.
Contribution
It formulates MAP inference as a non-linear minimum cost flow problem and applies DCA, enabling exact solutions with higher accuracy than prior approximate approaches.
Findings
Proposed method outperforms approximate methods in solution quality.
Efficiently computes MAP inference using convex cost flow algorithms.
Achieves exact inference for CGMs on path graphs.
Abstract
The importance of aggregated count data, which is calculated from the data of multiple individuals, continues to increase. Collective Graphical Model (CGM) is a probabilistic approach to the analysis of aggregated data. One of the most important operations in CGM is maximum a posteriori (MAP) inference of unobserved variables under given observations. Because the MAP inference problem for general CGMs has been shown to be NP-hard, an approach that solves an approximate problem has been proposed. However, this approach has two major drawbacks. First, the quality of the solution deteriorates when the values in the count tables are small, because the approximation becomes inaccurate. Second, since continuous relaxation is applied, the integrality constraints of the output are violated. To resolve these problems, this paper proposes a new method for MAP inference for CGMs on path graphs.…
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
Taxonomy
TopicsBayesian Modeling and Causal Inference · Advanced Graph Neural Networks · Data Management and Algorithms
