A differential semantics for jointree algorithms

James D. Park, Adnan Darwiche
2004 Artificial Intelligence  
A new approach to inference in belief networks has been recently proposed, which is based on an algebraic representation of belief networks using multi-linear functions. According to this approach, belief network inference reduces to a simple process of evaluating and differentiating multi-linear functions. We show here that mainstream inference algorithms based on jointrees are a special case of the approach based on multi-linear functions, in a very precise sense. We use this result to prove
more » ... ew properties of jointree algorithms. We also discuss some practical and theoretical implications of this new finding. (A. Darwiche). 1 Such networks have local structure, and are outside the scope of mainstream algorithms for inference in belief networks whose complexity is exponential in treewidth.
doi:10.1016/j.artint.2003.04.004 fatcat:sjozzzsd6jbt7aepkanozipu4m