Active-LATHE: An Active Learning Algorithm for Boosting the Error Exponent for Learning Homogeneous Ising Trees

10/27/2021
by   Fengzhuo Zhang, et al.
0

The Chow-Liu algorithm (IEEE Trans. Inform. Theory, 1968) has been a mainstay for the learning of tree-structured graphical models from i.i.d. sampled data vectors. Its theoretical properties have been well-studied and are well-understood. In this paper, we focus on the class of trees that are arguably even more fundamental, namely homogeneous trees in which each pair of nodes that forms an edge has the same correlation ρ. We ask whether we are able to further reduce the error probability of learning the structure of the homogeneous tree model when active learning or active sampling of nodes or variables is allowed. Our figure of merit is the error exponent, which quantifies the exponential rate of decay of the error probability with an increasing number of data samples. At first sight, an improvement in the error exponent seems impossible, as all the edges are statistically identical. We design and analyze an algorithm Active Learning Algorithm for Trees with Homogeneous Edge (Active-LATHE), which surprisingly boosts the error exponent by at least 40% when ρ is at least 0.8. For all other values of ρ, we also observe commensurate, but more modest, improvements in the error exponent. Our analysis hinges on judiciously exploiting the minute but detectable statistical variation of the samples to allocate more data to parts of the graph in which we are less confident of being correct.

READ FULL TEXT
research
09/28/2009

Learning Gaussian Tree Models: Analysis of Error Exponents and Extremal Structures

The problem of learning tree-structured Gaussian graphical models from i...
research
01/22/2013

Active Learning on Trees and Graphs

We investigate the problem of active learning on a given tree whose node...
research
04/13/2014

Active Learning for Undirected Graphical Model Selection

This paper studies graphical model selection, i.e., the problem of estim...
research
06/15/2018

On the Relationship between Data Efficiency and Error for Uncertainty Sampling

While active learning offers potential cost savings, the actual data eff...
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 ...
research
06/17/2022

Towards Efficient Active Learning of PDFA

We propose a new active learning algorithm for PDFA based on three main ...
research
01/29/2019

Identifiability of Gaussian Structural Equation Models with Homogeneous and Heterogeneous Error Variances

In this work, we consider the identifiability assumption of Gaussian str...

Please sign up or login with your details

Forgot password? Click here to reset