The power of linear estimators

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 403-412

  Valiant, Gregory ^a   Valiant, Paul ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Duality; Entropy Estimation; L1 Estimation; Property Testing

Indexed keywords

CONSTANT FACTORS; CONVERGENCE RATES; DISCRETE DISTRIBUTION; DISTRIBUTION PROPERTY; DOMAIN ELEMENTS; DUALITY; ENTROPY ESTIMATION; ENTROPY ESTIMATOR; EXPLICIT BOUNDS; EXPLICIT CONSTRUCTIONS; FUNDAMENTAL PROPERTIES; KL-DIVERGENCE; LINEAR ESTIMATORS; LOWER BOUNDS; NUMBER OF SAMPLES; OPTIMAL CONVERGENCE; POLYNOMIAL-TIME ALGORITHMS; PROBABILITY OF FAILURE; PROPERTY-TESTING; SAMPLE COMPLEXITY; SQUARE ROOTS; SUMMARY STATISTIC; UNIFORM DISTRIBUTION;

COMPUTER SCIENCE; ENTROPY; OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

ESTIMATION;

EID: 84855596440     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.81     Document Type: Conference Paper

References (30)

1. N. Alon, Y. Matias, and M. Szegedy, "The space complexity of approximating the frequency moments," J. Comput. System Sci., vol. 58, pp. 137-147, 1999.
2. Z. Bar-Yossef, T. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan, "Counting distinct elements in a data stream,"in Proc. 6th Workshop on Rand. and Approx. Techniques.
3. Z. Bar-Yossef, R. Kumar, and D. Sivakumar, "Sampling algorithms: Lower bounds and applications," in STOC, 2001.
4. T. Batu, "Testing properties of distributions," Ph.D. thesis, Cornell University, 2001.
5. T. Batu, S. Dasgupta, R. Kumar, and R. Rubinfeld, "The complexity of approximating the entropy," in STOC, 2002.
6. T. Batu, S. Dasgupta, R. Kumar, and R. Rubinfeld, "The complexity of approximating the entropy," SIAM Journal on Computing, 2005.
7. T. Batu, E. Fischer, L. Fortnow, R. Kumar, R. Rubinfeld, and P. White, "Testing random variables for independence and identity," in FOCS, 2001.
8. T. Batu, L. Fortnow, R. Rubinfeld, W. Smith, and P. White, "Testing that distributions are close," in FOCS, 2000.
9. M. Brautbar and A. Samorodnitsky, "Approximating entropy from sublinear samples," in SODA, 2007.
10. J. Bunge, "Bibliography of references on the problem of estimating support size," available at http://www.stat.cornell.edu/~bunge/ bibliography.html
11. A. Carlton, "On the bias of information estimates," Psychological Bulletin, vol. 71, pp. 108-109, 1969.
12. A. Chakrabarti, G. Cormode, and A. McGregor, "A near-optimal algorithm for computing the entropy of a stream,"in SODA, 2007.
13. M. Charikar, S. Chaudhuri, R. Motwani, and V. Narasayya, "Towards estimation error guarantees for distinct values," in PODS, 2000.
14. B. Efron and C. Stein, "The jacknife estimate of variance,"Annals of Statistics, vol. 9, pp. 586-596, 1981.
15. O. Goldreich, S. Goldwasser, and D. Ron, "Property testing and its connection to learning and approximation," in FOCS, 1996.
16. S. Guha, A. McGregor, and S. Venkatasubramanian, "Streaming and sublinear approximation of entropy and information distances," in SODA, 2006.
17. N. Harvey, J. Nelson, and K. Onak, "Sketching and streaming entropy via approximation theory," in FOCS, 2008.
18. P. Indyk and D. Woodruff, "Tight lower bounds for the distinct elements problem," in FOCS, 2003.
19. D. Kane, J. Nelson, and D. Woodruff, "An optimal algorithm for the distinct elements problem," in PODS, 2010.
20. G. Miller, "Note on the bias of information estimates, "Information Theory in Psychology. II-B, pp. 95-100, 1955.
21. L. Paninski, "Estimation of entropy and mutual information, "Neural Computation, vol. 15, no. 6, pp. 1191-1253, 2003.
22. L. Paninski, "Estimating entropy on m bins given fewer than m samples," IEEE Trans. on Information Theory, vol. 50, no. 9, pp. 2200-2203, 2004.
23. S. Panzeri and A. Treves, "Analytical estimates of limited sampling biases in different information measures," Network: Computation in Neural Systems, vol. 7, pp. 87-107, 1996.
24. S. Raskhodnikova, D. Ron, A. Shpilka, and A. Smith, "Strong lower bounds for approximating distribution support size and the distinct elements problem," SIAM J. Comput., vol. 39, no. 3, pp. 813-842, 2009.
25. A. Treves and S. Panzeri, "The upward bias in measures of information derived from limited data samples," Neural Computation, vol. 7, pp. 399-407, 1995.
26. G. Valiant and P. Valiant, "Estimating the unseen: an n/ log(n)-sample estimator for entropy and support size, shown optimal via new CLTs," STOC, 2011.
27. G. Valiant and P. Valiant, "A CLT and tight lower bounds for estimating entropy," available at: http://www.eccc.unitrier.de/report/2010/ 179/, 2010.
28. G. Valiant and P. Valiant, "Estimating the unseen: a sublinear-sample canonical estimator of distributions," available at: http://www.eccc.uni-trier.de/report/2010/180/, 2010.
29. P. Valiant, "Testing symmetric properties of distributions," in STOC, 2008.
30. J. Victor, "Asymptotic bias in information estimates and the exponential (Bell) polynomials," Neural Computation, vol. 12, pp. 2797-2804, 2000.