# PAC-learning bounded tree-width Graphical Models

@inproceedings{Narasimhan2004PAClearningBT, title={PAC-learning bounded tree-width Graphical Models}, author={Mukund Narasimhan and Jeff A. Bilmes}, booktitle={UAI}, year={2004} }

- Published 2004 in UAI

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. Previous approaches to this problem, such as those of Chow ([1]), and Hoffgen ([7]) have shown that this class is PAClearnable by reducing it to a combinatorial optimization problem. However, for k > 1, this problem is NPcomplete ([15]), and so unless P=NP, these approaches will take exponential amounts of time. Our… CONTINUE READING

Highly Cited

This paper has 72 citations. REVIEW CITATIONS

Recent Discussions

This paper has been referenced on Twitter 2 times over the past 90 days. VIEW TWEETS

#### From This Paper

##### Figures, tables, and topics from this paper.

51 Citations

17 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 72 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**72**citations based on the available data.See our **FAQ** for additional information.