An Advance on Variable Elimination with Applications to Tensor-Based Computation

We present new results on the classical algorithm of variable elimination, which underlies many algorithms including for probabilistic inference. The results relate to exploiting functional dependencies, allowing one to perform inference and learning efficiently on models that have very large treewidth... (read more)

Results in Papers With Code
(↓ scroll down to see all results)