Learning Gaussian Graphical Models via Multiplicative Weights

Abstract

Graphical model selection in Markov random fields is a fundamental problem in statistics and machine learning. Two particularly prominent models, the Ising model and Gaussian model, have largely developed in parallel using different (though often related) techniques, and several practical algorithms with rigorous sample complexity bounds have been established for each. In this paper, we adapt a recently proposed algorithm of Klivans and Meka (FOCS, 2017), based on the method of multiplicative weight updates, from the Ising model to the Gaussian model, via non-trivial modifications to both the algorithm and its analysis. The algorithm enjoys a sample complexity bound that is qualitatively similar to others in the literature, has a low runtime $O(m{p}^2)$ in the case of $m$ samples and $p$ nodes, and can trivially be implemented in an online manner.

AISTATS 2020

References in corpus (6)

• Interaction Screening: Efficient and Sample-Optimal Learning of Ising Models
• Information Theoretic Properties of Markov Random Fields, and their Algorithmic Applications
• Learning Gaussian Graphical Models With Fractional Marginal Pseudo-likelihood
• Structure learning of antiferromagnetic Ising models
• Learning Some Popular Gaussian Graphical Models without Condition Number Bounds
• Information Theoretic Optimal Learning of Gaussian Graphical Models