Maximum entropy relaxation for multiscale graphical model selection

We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden variables and learn a sparse graphical model approximation on the entire set of variables (original and hidden). Our method for learning such models is based on maximizing entropy over an exponential family of graphical models, subject to divergence constraints on small subsets of variables. We demonstrate the advantages of our approach compared to methods that do not use hidden variables (which do not capture long-range behavior) and methods that use tree-structure approximations (which result in blocky artifacts).

• Type: Conference
• Year: 2008
• Where: ICASSP
• Authors: Myung Jin Choi, Venkat Chandrasekaran, Alan S. Willsky
• Keywords: Graphical Models, Hidden Variables, ICASSP 2008, Multiscale Graphical Models, Signal Processing