Inference by Minimizing Size, Divergence, or their Sum

Details Inference by Minimizing Size, Divergence, or their Sum Inference by Minimizing Size, Divergence, or their Sum

2012-03-15

arxiv.org/abs/1203.3511v1

Computer Science

Learning

Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)

Scientific paper

We speed up marginal inference by ignoring factors that do not significantly contribute to overall accuracy. In order to pick a suitable subset of factors to ignore, we propose three schemes: minimizing the number of model factors under a bound on the KL divergence between pruned and full models; minimizing the KL divergence under a bound on factor count; and minimizing the weighted sum of KL divergence and factor count. All three problems are solved using an approximation of the KL divergence than can be calculated in terms of marginals computed on a simple seed graph. Applied to synthetic image denoising and to three different types of NLP parsing models, this technique performs marginal inference up to 11 times faster than loopy BP, with graph sizes reduced up to 98%-at comparable error in marginals and parsing accuracy. We also show that minimizing the weighted sum of divergence and size is substantially faster than minimizing either of the other objectives based on the approximation to divergence presented here.

Affiliated with

Also associated with

No associations

Rating

Inference by Minimizing Size, Divergence, or their Sum 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 Inference by Minimizing Size, Divergence, or their Sum, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inference by Minimizing Size, Divergence, or their Sum will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32320