Sample-Optimal and Efficient Learning of Tree Ising models

10/28/2020
by   Constantinos Daskalakis, et al.
0

We show that n-variable tree-structured Ising models can be learned computationally-efficiently to within total variation distance ϵ from an optimal O(n ln n/ϵ^2) samples, where O(·) hides an absolute constant which, importantly, does not depend on the model being learned - neither its tree nor the magnitude of its edge strengths, on which we place no assumptions. Our guarantees hold, in fact, for the celebrated Chow-Liu [1968] algorithm, using the plug-in estimator for estimating mutual information. While this (or any other) algorithm may fail to identify the structure of the underlying model correctly from a finite sample, we show that it will still learn a tree-structured model that is ϵ-close to the true one in total variation distance, a guarantee called "proper learning." Our guarantees do not follow from known results for the Chow-Liu algorithm and the ensuing literature on learning graphical models, including a recent renaissance of algorithms on this learning challenge, which only yield asymptotic consistency results, or sample-inefficient and/or time-inefficient algorithms, unless further assumptions are placed on the graphical model, such as bounds on the "strengths" of the model's edges/hyperedges. While we establish guarantees for a widely known and simple algorithm, the analysis that this algorithm succeeds and is sample-optimal is quite complex, requiring a hierarchical classification of the edges into layers with different reconstruction guarantees, depending on their strength, combined with delicate uses of the subadditivity of the squared Hellinger distance over graphical models to control the error accumulation.

READ FULL TEXT
research
11/23/2022

Learning and Testing Latent-Tree Ising Models Efficiently

We provide time- and sample-efficient algorithms for learning and testin...
research
06/07/2021

Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models

We consider the problem of learning a tree-structured Ising model from d...
research
06/18/2018

The Minimax Learning Rate of Normal and Ising Undirected Graphical Models

Let G be an undirected graph with m edges and d vertices. We show that d...
research
11/09/2020

Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu

We provide finite sample guarantees for the classical Chow-Liu algorithm...
research
04/22/2016

Learning a Tree-Structured Ising Model in Order to Make Predictions

We study the problem of learning a tree graphical model from samples suc...
research
12/03/2014

Structure learning of antiferromagnetic Ising models

In this paper we investigate the computational complexity of learning th...
research
05/09/2020

Exact Asymptotics for Learning Tree-Structured Graphical Models with Side Information: Noiseless and Noisy Samples

Given side information that an Ising tree-structured graphical model is ...

Please sign up or login with your details

Forgot password? Click here to reset