Computer Science – Artificial Intelligence
Scientific paper
2012-02-14
Computer Science
Artificial Intelligence
Scientific paper
Inference in graphical models consists of repeatedly multiplying and summing out potentials. It is generally intractable because the derived potentials obtained in this way can be exponentially large. Approximate inference techniques such as belief propagation and variational methods combat this by simplifying the derived potentials, typically by dropping variables from them. We propose an alternate method for simplifying potentials: quantizing their values. Quantization causes different states of a potential to have the same value, and therefore introduces context-specific independencies that can be exploited to represent the potential more compactly. We use algebraic decision diagrams (ADDs) to do this efficiently. We apply quantization and ADD reduction to variable elimination and junction tree propagation, yielding a family of bounded approximate inference schemes. Our experimental tests show that our new schemes significantly outperform state-of-the-art approaches on many benchmark instances.
Domingos Pedro
Gogate Vibhav
No associations
LandOfFree
Approximation by Quantization 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 Approximation by Quantization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation by Quantization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-90450