Adaptive Stratified Sampling for Precision-Recall Estimation

We propose a new algorithm for computing a constant-factor approximation of precisionrecall (PR) curves for massive noisy datasets produced by generative models. Assessing validity of items in such datasets requires human annotation, which is costly and must be minimized. Our algorithm, A DA S TRAT, is the first data-aware method for this task. It chooses the next point to query on the PR curve adaptively, based on previous observations. It then selects specific items to annotate using stratified sampling. Under a mild monotonicity assumption, A DA S TRAT outputs a guaranteed approximation of the underlying precision function, while using a number of annotations that scales very slowly with N, the dataset size. For example, when the minimum precision is bounded by a constant, it issues only log log N precision queries. In general, it has a regret of no more than log log N w. r. t. an oracle that issues queries at data-dependent (unknown) optimal points. On a scaled-up NLP dataset of 3. 5M items, A DA S TRAT achieves a remarkably close approximation of the true precision function using only 18 precision queries, 13x fewer than best previous approaches.

Authors

• Ashish Sabharwal
• Yexiang Xue

Keywords

No keywords are indexed for this paper.