Active Learning Algorithms for Graphical Model Selection

02/01/2016
by   Gautam Dasarathy, et al.
0

The problem of learning the structure of a high dimensional graphical model from data has received considerable attention in recent years. In many applications such as sensor networks and proteomics it is often expensive to obtain samples from all the variables involved simultaneously. For instance, this might involve the synchronization of a large number of sensors or the tagging of a large number of proteins. To address this important issue, we initiate the study of a novel graphical model selection problem, where the goal is to optimize the total number of scalar samples obtained by allowing the collection of samples from only subsets of the variables. We propose a general paradigm for graphical model selection where feedback is used to guide the sampling to high degree vertices, while obtaining only few samples from the ones with the low degrees. We instantiate this framework with two specific active learning algorithms, one of which makes mild assumptions but is computationally expensive, while the other is more computationally efficient but requires stronger (nevertheless standard) assumptions. Whereas the sample complexity of passive algorithms is typically a function of the maximum degree of the graph, we show that the sample complexity of our algorithms is provable smaller and that it depends on a novel local complexity measure that is akin to the average degree of the graph. We finally demonstrate the efficacy of our framework via simulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2014

Active Learning for Undirected Graphical Model Selection

This paper studies graphical model selection, i.e., the problem of estim...
research
07/16/2011

On Learning Discrete Graphical Models Using Greedy Methods

In this paper, we address the problem of learning the structure of a pai...
research
11/19/2020

Finding the Homology of Decision Boundaries with Active Learning

Accurately and efficiently characterizing the decision boundary of class...
research
06/10/2018

Identifiability in Gaussian Graphical Models

In high-dimensional graph learning problems, some topological properties...
research
06/01/2023

CS4ML: A general framework for active learning with arbitrary data based on Christoffel functions

We introduce a general framework for active learning in regression probl...
research
07/08/2016

Lower Bounds on Active Learning for Graphical Model Selection

We consider the problem of estimating the underlying graph associated wi...
research
06/10/2018

Stationary Geometric Graphical Model Selection

We consider the problem of model selection in Gaussian Markov fields in ...

Please sign up or login with your details

Forgot password? Click here to reset