40 citations · 40 across the 2 of their papers we have counts for
2 papers
cs.LG2012
PAC-learning bounded tree-width Graphical Models
Mukund Narasimhan, Jeff A. Bilmes
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Previ…
cs.LG2012★ 40 cited
A submodular-supermodular procedure with applications to discriminative structure learning
Mukund Narasimhan, Jeff A. Bilmes
In this paper, we present an algorithm for minimizing the difference between two submodular functions using a variational framework which is based on (an extension of) the concave-…