On triangulating dynamic graphical models

Authors:
Jeff A. Bilmes;Chris Bartels
Affiliations:
Departmant of Electrical Engineering, University of Washington, Seattle, WA;Departmant of Electrical Engineering, University of Washington, Seattle, WA
Venue:
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Year:
2002

Citing 5
Cited 1

A computational scheme for reasoning in dynamic probabilistic networks

UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Random Generation of Bayesian Networks

SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Learning Dynamic Bayesian Networks

Adaptive Processing of Sequences and Data Structures, International Summer School on Neural Networks, "E.R. Caianiello"-Tutorial Lectures
Dynamic bayesian networks: representation, inference and learning

Dynamic bayesian networks: representation, inference and learning
Temporally invariant junction tree for inference in dynamic Bayesian network

Artificial intelligence today

A dynamic Bayesian framework to model context and memory in edit distance learning: an application to pronunciation classification

ACL '05 Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified so the repeating and unrolled graph section may dissect the original DBN time slice and may also span (and partially intersect) many such slices. We introduce the notion of a "boundary" which divides a graph into multi-slice partitions each of which has an interface, and define the "boundary algorithm", a method to find the best boundary (and corresponding interface) between partitions in such models. We prove that, after using this algorithm, the sizes of the best forwardand backward- interface (and also the corresponding fill-ins) are identical. The boundary algorithm allows for constrained elimination orders (and therefore graph triangulations) that are impossible using standard slice-by-slice constrained elimination. We describe the above using the Graphical Model ToolKit (GMTK)'s notion of dynamic graphical model, slightly generalizing standard DBN templates. We report triangulation results on hand-concocted graphs, novel speech recognition DBNs, and random graphs, and find that the boundary algorithm can significantly improve both tree width and graph weight.