Abstract
We consider the problem of testing a basic property of collections of distributions: having similar means. Namely, the algorithm should accept collections of distributions in which all distributions have means that do not differ by more than some given parameter, and should reject collections that are relatively far from having this property. By ‘far’ we mean that it is necessary to modify the distributions in a relatively significant manner (measured according to the ℓ1 distance averaged over the distributions) so as to obtain the property. We study this problem in two models. In the first model (the query model) the algorithm may ask for samples from any distribution of its choice, and in the second model (the sampling model) the distributions from which it gets samples are selected randomly. We provide upper and lower bounds in both models. In particular, in the query model, the complexity of the problem is polynomial in 1/ε (where ε is the given distance parameter). While in the sampling model, the complexity grows roughly as m 1 − poly(ε), where m is the number of distributions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Batu, T., Fortnow, L., Fischer, E., Kumar, R., Rubinfeld, R., White, P.: Testing random variables for independence and identity. In: Proceedings of FOCS, pp. 442–451 (2001)
Batu, T., Fortnow, L., Rubinfeld, R., Smith, W.D., White, P.: Testing that distributions are close. In: Proceedings of FOCS, pp. 259–269 (2000)
Chebyshev, P.L.: Théorie des mécanismes connus sous le nom de parallélogrammes. Mémoires des Savants étrangers présentés â l’Académie de Saint-Pétersbourg 7, 539–586 (1854)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM 45(4), 653–750 (1998)
Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica, 302–343 (2002)
Larsen, R.J., Marx, M.L.: An introduction to mathematical statistics and its applications, vol. 1. Pearson Prentice Hall (2006)
Levi, R., Ron, D., Rubinfeld, R.: Testing properties of collections of distributions. Technical Report TR10-157, Electronic Colloquium on Computational Complexity (ECCC) (2010)
Levi, R., Ron, D., Rubinfeld, R.: Testing properties of collections of distributions. In: Proceedings of ICS, pp. 179–194 (2011); See also ECCC TR10-157
Levi, R., Ron, D., Rubinfeld, R.: Testing similar means. Technical Report TR12-055, Electronic Colloquium on Computational Complexity (ECCC) (2012)
Mendenhall, W., Beaver, R.J., Beaver, B.M.: Introduction to probability and statistics. Brooks/Cole, Cengage Learning (2009)
Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 252–271 (1996)
Student. The probable error of a mean. Biometrika 6, 1–25 (1908)
Valiant, G., Valiant, P.: Estimating the unseen: an n/log(n)-sample estimator for entropy and support size, shown optimal via new CLTs. In: Proceedings of STOC, pp. 685–694 (2011)
Valiant, P.: Testing symmetric properties of distributions. In: Proceedings of STOC, pp. 383–392 (2008)
Welch, B.L.: The generalization of ‘student’s’ problem when several different population variances are involved. Biometrika 34, 28–35 (1947)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Levi, R., Ron, D., Rubinfeld, R. (2012). Testing Similar Means. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31594-7_53
Download citation
DOI: https://doi.org/10.1007/978-3-642-31594-7_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31593-0
Online ISBN: 978-3-642-31594-7
eBook Packages: Computer ScienceComputer Science (R0)