Threshold rules for online sample selection

Authors:
Eric Bach;Shuchi Chawla;Seeun Umboh
Affiliations:
Computer Sciences Dept., University of Wisconsin, Madison;Computer Sciences Dept., University of Wisconsin, Madison;Computer Sciences Dept., University of Wisconsin, Madison
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 7
Cited 0

Online computation and competitive analysis

Online computation and competitive analysis
On the Average Number of Maxima in a Set of Vectors and Applications

Journal of the ACM (JACM)
Optimal oblivious routing in polynomial time

Journal of Computer and System Sciences - Special issue: STOC 2003
Universal approximations for TSP, Steiner tree, and set cover

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Oblivious network design

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The hiring problem and Lake Wobegon strategies

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computing all skyline probabilities for uncertain data

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the following sample selection problem. We observe in an online fashion a sequence of samples, each endowed by a quality. Our goal is to either select or reject each sample, so as to maximize the aggregate quality of the subsample selected so far. There is a natural trade-off here between the rate of selection and the aggregate quality of the subsample. We show that for a number of such problems extremely simple and oblivious "threshold rules" for selection achieve optimal tradeoffs between rate of selection and aggregate quality in a probabilistic sense. In some cases we show that the same threshold rule is optimal for a large class of quality distributions and is thus oblivious in a strong sense.