2000 character limit reached
Structural query-by-committee
Published 17 Mar 2018 in cs.LG and stat.ML | (1803.06586v1)
Abstract: In this work, we describe a framework that unifies many different interactive learning tasks. We present a generalization of the {\it 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.
Paper Prompts
Sign up for free to create and run prompts on this paper.