Quantifying Nonlocal Informativeness in High-Dimensional, Loopy Gaussian Graphical Models
Name
How_Quantifying nonlocal.pdf
Size
397.36 KB
Format
Adobe PDF
Checksum (MD5)
1a151ca97b0edd3a343a127551a7fc83
Author(s)
Levine, Daniel
How, Jonathan P.
Date Issued
July 2014
Journal
Proceedings of the 2014 30th Conference on Uncertainty in Artifical Intelligence
Publisher
Association of Uncertainty in Artifical Intelligence
Citation
Levine, Daniel, and Jonathan P. How. "Quantifying Nonlocal Informativeness in High-Dimensional, Loopy Gaussian Graphical Models." 2014 30th Conference on Uncertainty in Artifical Intelligence, Quebec, Canada, July 23-27, 2014
Version
Author's final manuscript
Abstract
We consider the problem of selecting informative observations in Gaussian graphical models containing both cycles and nuisances. More specifically, we consider the subproblem of quantifying conditional mutual information measures that are nonlocal on such graphs. The ability to efficiently quantify the information content of observations is crucial for resource-constrained data acquisition (adaptive sampling) and data processing (active learning) systems. While closed-form expressions for Gaussian mutual information exist, standard linear algebraic techniques, with complexity cubic in the network size, are intractable for high-dimensional distributions. We investigate the use of embedded trees for computing nonlocal pairwise mutual information and demonstrate through numerical simulations that the presented approach achieves a significant reduction in computational cost over inversion-based methods.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
http://auai.org/uai2014/acceptedPapers.shtml
