Lower Bounds for Sampling Algorithms for Estimating the Average

@article{Canetti1995LowerBF,
  title={Lower Bounds for Sampling Algorithms for Estimating the Average},
  author={Ran Canetti and Guy Even and Oded Goldreich},
  journal={Inf. Process. Lett.},
  year={1995},
  volume={53},
  pages={17-25}
}
We show lower bounds on the number of sample points and on the number of coin tosses used by general sampling algorithms for estimating the average value of functions over a large domain. The bounds depend on the desired precision and on the error probability of the estimate. Our lower bounds match upper bounds established by known algorithms, up to a mul-tiplicative constant. Furthermore, we give a non-constructive proof of existence of an algorithm that improves the known upper bounds by a… CONTINUE READING
Highly Cited
This paper has 134 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

134 Citations

051015'93'98'04'10'16
Citations per Year
Semantic Scholar estimates that this publication has 134 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

\Lower Bounds for Sampling Algorithms for Estimating the Average

Ceg, R Canetti, Guy Even, O Goldreich
\Lower Bounds for Sampling Algorithms for Estimating the Average • 1993

Common Random Bits in Communication Complexity

N I Newman, private Vs
Information Processing Letters • 1991

\Monte-Carlo Algorithms for Enumeration and Related Problems

Kl, R M Karp, M Luby
\Monte-Carlo Algorithms for Enumeration and Related Problems • 1983

Van Trees, \Detection, Estimation, and Modulation Theory

Vt
Van Trees, \Detection, Estimation, and Modulation Theory • 1968

Hoefding, \Probability Inequalities for Sums of Bounded Random Variables

W Ho
Journal of the American Statistical Association • 1963