Sampling from Gaussian graphical models using subgraph perturbations
Author(s)Liu, Ying; Kosut, Oliver; Willsky, Alan S.
MetadataShow full item record
The problem of efficiently drawing samples from a Gaussian graphical model or Gaussian Markov random field is studied. We introduce the subgraph perturbation sampling algorithm, which makes use of any pre-existing tractable inference algorithm for a subgraph by perturbing this algorithm so as to yield asymptotically exact samples for the intended distribution. The subgraph can have any structure for which efficient inference algorithms exist: for example, tree-structured, low tree-width, or having a small feedback vertex set. The experimental results demonstrate that this subgraph perturbation algorithm efficiently yields accurate samples for many graph topologies.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Proceedings of the 2013 IEEE International Symposium on Information Theory
Institute of Electrical and Electronics Engineers (IEEE)
Liu, Ying, Oliver Kosut, and Alan S. Willsky. “Sampling from Gaussian Graphical Models Using Subgraph Perturbations.” 2013 IEEE International Symposium on Information Theory (July 2013).
Author's final manuscript