DeepAI AI Chat
Log In Sign Up

Tensor Variable Elimination for Plated Factor Graphs

by   Fritz Obermeyer, et al.

A wide class of machine learning algorithms can be reduced to variable elimination on factor graphs. While factor graphs provide a unifying notation for these algorithms, they do not provide a compact way to express repeated structure when compared to plate diagrams for directed graphical models. To exploit efficient tensor algebra in graphs with plates of variables, we generalize undirected factor graphs to plated factor graphs and variable elimination to a tensor variable elimination algorithm that operates directly on plated factor graphs. Moreover, we generalize complexity bounds based on treewidth and characterize the class of plated factor graphs for which inference is tractable. As an application, we integrate tensor variable elimination into the Pyro probabilistic programming language to enable exact inference in discrete latent variable models with repeated structure. We validate our methods with experiments on both directed and undirected graphical models, including applications to polyphonic music modeling, animal movement modeling, and latent sentiment analysis.


page 1

page 2

page 3

page 4


Factor Graph Grammars

We propose the use of hyperedge replacement graph grammars for factor gr...

Variable Elimination in the Fourier Domain

The ability to represent complex high dimensional probability distributi...

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

We present new results on the classical algorithm of variable eliminatio...

IPF for Discrete Chain Factor Graphs

Iterative Proportional Fitting (IPF), combined with EM, is commonly used...

An Efficient Algorithm for Computing Interventional Distributions in Latent Variable Causal Models

Probabilistic inference in graphical models is the task of computing mar...

BEEM : Bucket Elimination with External Memory

A major limitation of exact inference algorithms for probabilistic graph...

Lifted Variable Elimination: Decoupling the Operators from the Constraint Language

Lifted probabilistic inference algorithms exploit regularities in the st...