Logarithmic time parallel Bayesian inference

  • Authors:
  • David M. Pennock

  • Affiliations:
  • University of Michigan AI Laboratory, Ann Arbor, MI

  • Venue:
  • UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

I present a parallel algorithm for exact probabilistic inference in Bayesian networks. For polytree networks with n variables, the worstcase time complexity is O(logn) on a CREW PRAM (concurrent-read, exclusive-write parallel random-access machine) with n processors, for any constant number of evidence variables. For arbitrary networks, the time complexity is O(r3w log n) for n processors, or O(w log n) for r3w log n processors, where r is the maximum range of any variable, and w is the induced width (the maximum clique size), after moralizing and triangulating the network.