Apparaît dans la collection : 2016 - T1 - WS4 - Inference problems theme

Graph covers have been shown to be a very useful tool for analyzing and understanding message-passing iterative algorithms on factor graphs. In this talk, we introduce a novel technique for investigating the relationship between a base factor graph and its double covers. Potentially, this technique is also useful for analyzing graph covers of higher degree.