Abstract

Abstract. 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 P −n → [0, 1], we wish to estimate 2 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.

Citations

1478	The probabilistic method - Spencer - 1992
590	Universal classes of hash functions - Carter, Wegman - 1979
163	How to Recycle Random Bits - Impagliazzo, Zuckerman - 1989
159	Unbiased bits from sources of weak randomness and probabilistic communication complexity - Chor, Goldreich - 1985
137	λ1, isoperimetric inequalities for graphs, and superconcentrators - Alon, Milman - 1985
113	Expander graphs and their applications - Hoory, Linial, et al.
111	Recent developments in explicit constructions of extractors,” in Current trends in theoretical computer science. The Challenge of the New Century, vol 1: Algorithms and Complexity - Shaltiel - 2004
102	Constructions of asymptotically good low-rate error-correcting codes through pseudo-random graphs - Alon, Bruck, et al. - 1992
91	Deterministic Simulation in LOGSPACE - Ajtai, Komlós, et al. - 1987
90	and Zvi Galil. Explicit constructions of linear-sized superconcentrators - Gabber - 1981
84	On the power of two-point based sampling - Chor, Goldreich - 1989
73	Explicit expanders and the Ramanujan conjectures - Lubotzky, Phillips, et al. - 1986
66	1, isoperimetric inequalities for graphs, and superconcentrators - Alon, Milman - 1985
57	Randomness-efficient oblivious sampling - Bellare, Rompel - 1994
57	Extracting randomness: How and why. A survey - Nisan - 1996
50	Bounds for dispersers, extractors, and depth-two supperconcentrators - Radhakrishnan, Ta-Shma - 2000
48	Tiny families of functions with random properties: A qualitysize trade-off for hashing. Random Structures and Algorithms - Goldreich, Wigderson - 1997
48	Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes - Guruswami, Umans, et al. - 2007
46	Eigenvalues and Expansion of Regular Graphs - Kahale - 1995
39	Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory - Alon - 1986
34	When Hamming Meets Euclid: The Approximability of Geometric TSP - Trevisan
29	Randomness in interactive proofs - Bellare, Goldreich, et al. - 1993
23	Randomness-optimal sampling, extractors, and constructive leader election - Zuckerman
21	Shift Register Sequences, Holden-Day - Golomb - 1967
19	Lower Bounds for Sampling Algorithms for Estimating the Average - Canetti, Even, et al. - 1995
18	A time-randomness tradeoff - Karp, Pippenger, et al. - 1985
16	Random polynomial time is equal to semi-random polynomial time - Vazirani, Vazirani - 1988
8	Explicit Construction of Concentrators. Prob - Margulis - 1973
7	Security Preserving Amplification of Hardness", 31st FOCS - Goldreich, Impagliazzo, et al. - 1990
4	Dispensers, Deterministic Amplification - Cohen, Wigderson - 1989
3	Explicit Construction of Concentrators", Prob - Margulis - 1973
2	Goldwasser "Randomness in Interactive Proofs - Bellare, Goldreich, et al. - 1993
2	Expanders, Randomness or Time vs Space", Structure in Complexity Theory (proceedings - Sipser - 1986
2	Sampling Algorithms - Bar-Yossef, Kumar, et al.
2	Lower Bounds for Sampling Algorithms for Estimating - Canetti, Even, et al. - 1995
2	Randomness or Time vs Space”, Structure in Complexity Theory (proceedings - Sipser, “Expanders - 1986
2	Randomness-Optimal Oblivious Sampling. Journal of Random Structures and Algorithms - Zuckerman - 1997
1	Weak Random Sources, Hitting Sets, and BPP Simulation", manuscript - Andreev, Clementi, et al. - 1997
1	Addendum to [7], available from http://theory.lcs.mit.edu/~oded/papers.html - Bellare, Goldreich, et al. - 1997