On polyhedral approximations of polytopes for learning Bayes nets

Details On polyhedral approximations of polytopes for learning Bayes nets On polyhedral approximations of polytopes for learning Bayes nets

2011-07-23

arxiv.org/abs/1107.4708v3

Mathematics

Statistics Theory

Scientific paper

We review three vector encodings of Bayesian network structures. The first one has recently been applied by Jaakkola 2010, the other two use special integral vectors formerly introduced, called imsets [Studeny 2005, Studeny 2010]. The central topic is the comparison of outer polyhedral approximations of the corresponding polytopes. We show how to transform the inequalities suggested by Jaakkola et al. to the framework of imsets. The result of our comparison is the observation that the implicit polyhedral approximation of the standard imset polytope suggested in [Studeny 2011] gives a closer approximation than the (transformed) explicit polyhedral approximation from [Jaakkola 2010]. Finally, we confirm a conjecture from [Studeny 2011] that the above-mentioned implicit polyhedral approximation of the standard imset polytope is an LP relaxation of the polytope.

Affiliated with

Also associated with

No associations

Rating

On polyhedral approximations of polytopes for learning Bayes nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On polyhedral approximations of polytopes for learning Bayes nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On polyhedral approximations of polytopes for learning Bayes nets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-76374