Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs

K. S. Sesh Kumar, Francis R. Bach

Abstract: We consider the problem of learning the structure of undirected graphical models with bounded treewidth, within the maximum likelihood framework. This is an NP-hard problem and most approaches cons...