Non-Parametric Structure Learning on Hidden Tree-Shaped Distributions

We provide high probability sample complexity guarantees for non-parametric structure learning of tree-shaped graphical models whose nodes are discrete random variables with a finite or countable alphabet, both in the noiseless and noisy regimes. First, we introduce a new, fundamental quantity called the (noisy) information threshold, which arises naturally from the error analysis of the Chow-Liu algorithm and characterizes not only the sample complexity, but also the inherent impact of the noise on the structure learning task, without explicit assumptions on the distribution of the model. This allows us to present the first non-parametric, high-probability finite sample complexity bounds on tree-structure learning from potentially noise-corrupted data. In particular, for number of nodes p, success rate 1-δ, and a fixed value of the information threshold, our sample complexity bounds for exact structure recovery are of the order of O(log^1+ζ (p/δ)), for all ζ>0, for both noiseless and noisy settings. Subsequently, we apply our results on two classes of hidden models, namely, the M-ary erasure channel and the generalized symmetric channel, illustrating the usefulness and importance of our framework. As a byproduct of our analysis, this paper resolves the open problem of tree structure learning in the presence of non-identically distributed observation noise, providing explicit conditions on the convergence of the Chow-Liu algorithm under this setting as well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2018

Predictive Learning on Hidden Tree-Structured Ising Models

We provide high-probability sample complexity guarantees for exact struc...
research
12/11/2018

Predictive Learning on Sign-Valued Hidden Markov Trees

We provide high-probability sample complexity guarantees for exact struc...
research
02/17/2021

Robust Estimation of Tree Structured Markov Random Fields

We study the problem of learning tree-structured Markov random fields (M...
research
01/30/2013

Exact Inference of Hidden Structure from Sample Data in Noisy-OR Networks

In the literature on graphical models, there has been increased attentio...
research
08/04/2023

Learning Networks from Gaussian Graphical Models and Gaussian Free Fields

We investigate the problem of estimating the structure of a weighted net...
research
06/10/2020

Robust Estimation of Tree Structured Ising Models

We consider the task of learning Ising models when the signs of differen...
research
08/06/2021

Localization in 1D non-parametric latent space models from pairwise affinities

We consider the problem of estimating latent positions in a one-dimensio...

Please sign up or login with your details

Forgot password? Click here to reset