| Summary: | Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015. === Cataloged from PDF version of thesis. === Includes bibliographical references (pages 57-58). === We present a framework for approximate inference that, given a factor graph and a subset of its variables, produces an approximate marginal distribution over these variables with bounds. The factors of the factor graph are abstracted as as piecewise polynomial functions with lower and upper bounds, and a variant of the variable elimination algorithm solves the inference problem over this abstraction. The resulting distributions bound quantifies the error between it and the true distribution. We also give a set of heuristics for improving the bounds by further refining the binary space partition trees. === by Yewen Pu. === S.M.
|
|---|
