We consider the problem of estimating the average of a huge set of values. That is, given oracle access to an arbitrary function f:{0,1} n → [0,1], we wish to estimate 2 n∑x∈ {0,1} n f(x) upto an additive error of ε. We are allowed to employ a randomized algorithm that may err with probability at most δ. We survey known algorithms for this problem and focus on the ideas underlying their construction. In particular, we present an algorithm that makes O(ε -2 •log(1/δ)) queries and uses n+O(log(1/ε))+O(log(1/δ)) coin tosses, both complexities being very close to the corresponding lower bounds. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Goldreich, O. (2011). A sample of samplers: A computational perspective on sampling. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6650 LNCS, 302–332. https://doi.org/10.1007/978-3-642-22670-0_24
Mendeley helps you to discover research relevant for your work.