Importance sampling-based estimation over AND/OR search spaces for graphical models

  • Authors:

  • Vibhav Gogate;Rina Dechter

  • Affiliations:

  • Department of Computer Science, The University of Texas at Dallas, Richardson, TX 75080, USA;Department of Computer Science, The University of Texas at Dallas, Richardson, TX 75080, USA and Donald Bren School of Information and Computer Sciences, University of California, Irvine, CA 92697 ...

  • Venue:
  • Artificial Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is well known that the accuracy of importance sampling can be improved by reducing the variance of its sample mean and therefore variance reduction schemes have been the subject of much research. In this paper, we introduce a family of variance reduction schemes that generalize the sample mean from the conventional OR search space to the AND/OR search space for graphical models. The new AND/OR sample means allow trading time and space with variance. At one end is the AND/OR sample tree mean which has the same time and space complexity as the conventional OR sample tree mean but has smaller variance. At other end is the AND/OR sample graph mean which requires more time and space to compute but has the smallest variance. Theoretically, we show that the variance is smaller in the AND/OR space because the AND/OR sample mean is defined over a larger virtual sample size compared with the OR sample mean. Empirically, we demonstrate that the AND/OR sample mean is far closer to the true mean than the OR sample mean.