Structural query-by-committee

03/17/2018
by   Christopher Tosh, et al.
0

In this work, we describe a framework that unifies many different interactive learning tasks. We present a generalization of the query-by-committee active learning algorithm for this setting, and we study its consistency and rate of convergence, both theoretically and empirically, with and without noise.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/30/2016

Active Learning from Imperfect Labelers

We study active learning where the labeler can not only return incorrect...
research
06/05/2019

Diameter-based Interactive Structure Search

In this work, we introduce interactive structure search, a generic frame...
research
04/19/2019

Disagreement-based Active Learning in Online Settings

We study online active learning for classifying streaming instances with...
research
01/08/2019

Risk-Aware Active Inverse Reinforcement Learning

Active learning from demonstration allows a robot to query a human for s...
research
10/11/2019

Not All are Made Equal: Consistency of Weighted Averaging Estimators Under Active Learning

Active learning seeks to build the best possible model with a budget of ...
research
09/08/2016

Towards Better Response Times and Higher-Quality Queries in Interactive Knowledge Base Debugging

Many AI applications rely on knowledge encoded in a locigal knowledge ba...
research
07/20/2020

Toward Machine-Guided, Human-Initiated Explanatory Interactive Learning

Recent work has demonstrated the promise of combining local explanations...

Please sign up or login with your details

Forgot password? Click here to reset