Non-approximate Inference for Collective Graphical Models on Path Graphs via Discrete Difference of Convex Algorithm
Dec 6, 2021
Speakers
Yasunori Akagi
Speaker · 0 followers
Naoki Marumo
Speaker · 0 followers
Hideaki Kim
Speaker · 0 followers
Takeshi Kurashima
Speaker · 0 followers
Hiroyuki Toda
Speaker · 0 followers
About
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. Our method is based on the Difference of Convex Algorithm (DCA), which is a general methodology to minimize a function represented as the sum of a convex function and a concave function. In our algorithm, important subroutines in DCA can be efficiently calculated by minimum convex cost flow algorithms. Experiments show that the proposed method outputs higher quality solutions than the conventional approach.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.…
Organizer
NeurIPS 2021
Account · 1.9k followers
About NeurIPS 2021
Neural Information Processing Systems (NeurIPS) is a multi-track machine learning and computational neuroscience conference that includes invited talks, demonstrations, symposia and oral and poster presentations of refereed papers. Following the conference, there are workshops which provide a less formal setting.
Like the format? Trust SlidesLive to capture your next event!
Professional recording and live streaming, delivered globally.
Sharing
Recommended Videos
Presentations on similar topic, category or speaker
Isaac Gym: High Performance GPU Based Physics Simulation For Robot Learning
Watch later
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
Annotation Quality Framework - Accuracy,Credibility, and Consistency
Watch later
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
Data Agnostic Image Annotation
Watch later
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
Intro
Watch later
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
Curriculum Offline Imitating Learning
Watch later
Minghuan Liu, …
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%
The Inductive Bias of Quantum Kernels
Watch later
Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%