Efficient Bayesian Inference for Dynamically Changing Graphs
Abstract
Motivated by stochastic systems in which observed evidence and conditional de- pendencies between states of the network change over time, and certain quantities of interest (marginal distributions, likelihood estimates etc.) must be updated, we study the problem of adaptive inference in tree-structured Bayesian networks. We describe an algorithm for adaptive inference that handles a broad range of changes to the network and is able to maintain marginal distributions, MAP estimates, and data likelihoods in all expected logarithmic time. We give an implementation of our algorithm and provide experiments that show that the algorithm can yield up to two orders of magnitude speedups on answering queries and responding to dy- namic changes over the sum-product algorithm.
Cite
Text
Sumer et al. "Efficient Bayesian Inference for Dynamically Changing Graphs." Neural Information Processing Systems, 2007.Markdown
[Sumer et al. "Efficient Bayesian Inference for Dynamically Changing Graphs." Neural Information Processing Systems, 2007.](https://mlanthology.org/neurips/2007/sumer2007neurips-efficient/)BibTeX
@inproceedings{sumer2007neurips-efficient,
title = {{Efficient Bayesian Inference for Dynamically Changing Graphs}},
author = {Sumer, Ozgur and Acar, Umut and Ihler, Alexander T. and Mettu, Ramgopal R.},
booktitle = {Neural Information Processing Systems},
year = {2007},
pages = {1441-1448},
url = {https://mlanthology.org/neurips/2007/sumer2007neurips-efficient/}
}