Near-Exponential Savings for Mean Estimation with Active Learning
Julian M. Morimoto, Jacob Goldin, and Daniel E. Ho

TL;DR
This paper introduces PartiBandits, an active learning algorithm that achieves near-exponential savings in label complexity for mean estimation of a multi-class variable by adaptively partitioning data and using UCB strategies.
Contribution
The paper proposes a novel two-stage active learning algorithm that combines UCB and disagreement-based methods, achieving minimax optimal convergence rates for mean estimation.
Findings
Achieves near-exponential label savings with respect to N.
Convergence rates are minimax optimal in classical settings.
Demonstrates effectiveness through simulations with electronic health records.
Abstract
We study the problem of efficiently estimating the mean of a -class random variable, , using a limited number of labels, , in settings where the analyst has access to auxiliary information (i.e.: covariates) that may be informative about . We propose an active learning algorithm ("PartiBandits") to estimate . The algorithm yields an estimate, , such that is , where is a constant and is the risk of the Bayes-optimal classifier. PartiBandits is essentially a two-stage algorithm. In the first stage, it learns a partition of the unlabeled data that shrinks the average conditional variance of . In the second stage it uses a UCB-style subroutine ("WarmStart-UCB") to request labels…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Advanced Bandit Algorithms Research · Imbalanced Data Classification Techniques
