Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
The average-case complexity of counting distinct elements
Proceedings of the 12th International Conference on Database Theory
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
We consider the problem of approximating the support size of a distribution from a small number of samples, when each element in the distribution appears with probability at least \frac{1} {n}. This problem is closely related to the problem of approximating the number of distinct elements in a sequence of length n. For both problems, we prove a nearly linear in n lower bound on the query complexity, applicable even for approximation with additive error.At the heart of the lower bound is a construction of two positive integer random variables, E[X_1 ]/E[X_2 ] = E[X_1^2 ]/E[X_2^2 ] =\ldots= E[X_1^k /E[X_2^k ]. Our lower bound method is also applicable to other problems. In particular, it gives new lower bounds for the sample complexity of (1) approximating the entropy of a distribution and (2) approximating how well a given string is compressed by the Lempel-Ziv scheme.