Testing symmetric properties of distributions

SIAM Journal on Computing

Volumn 40, Issue 6, 2011, Pages 1927-1968

  Valiant, Paul ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Entropy approximation; L 1 distance approximation; Lower bounds; Poissonization; Statistical properties; Vandermonde matrices

Indexed keywords

L 1 DISTANCE APPROXIMATION; LOWER BOUNDS; POISSONIZATION; STATISTICAL PROPERTIES; VANDERMONDE MATRIX;

ENTROPY;

APPROXIMATION ALGORITHMS;

EID: 84855592016     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080734066     Document Type: Conference Paper

References (30)

1. N. ALON, A. ANDONI, T. KAUFMAN, K. MATULEF, R. RUBINFELD, AND N. XIE, Testing κ-wise and almost κ-wise independence, in Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007, pp. 496-505.
2. N. ALON, E. FISCHER, I. NEWMAN, AND A. SHAPIRA, A combinatorial characterization of the testable graph properties: It's all about regularity, SIAM J. Comput., 39(2009), pp. 143-167.
3. T. BATU, Testing Properties of Distributions, Ph. D. thesis, Cornell University, Ithaca, NY, 2001.
4. T. BATU, S. DASGUPTA, R. KUMAR, AND R. RUBINFELD, The complexity of approximating the entropy, SIAM J. Comput., 35(2005), pp. 132-150.
5. T. BATU, E. FISCHER, L. FORTNOW, R. KUMAR, R. RUBINFELD, AND P. WHITE, Testing random variables for independence and identity, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001, pp. 442-451. (Pubitemid 33068405)
6. T. BATU, L. FORTNOW, R. RUBINFELD, W. D. SMITH, AND P. WHITE, Testing that distributions are close, in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000, pp. 259-269. (Pubitemid 32871356)
7. T. BATU, R. KUMAR, AND R. RUBINFELD, Sublinear algorithms for testing monotone and unimodal distributions, in Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004, pp. 381-390.
8. A. BHATTACHARYYA, E. FISCHER, R. RUBINFELD, AND P. VALIANT, Testing monotonicity of distributions over general partial orders, in Proceedings of Innovations in Computer Science, 2011, pp. 239-252.
9. M. BLUM AND S. KANNAN, Designing programs that check their work, J. Assoc. Comput. Mach., 42(1995), pp. 269-291.
10. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47(1993), pp. 549-595.
11. M. BRAUTBAR AND A. SAMORODNITSKY, Approximating entropy from sublinear samples, in Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 366-375.
12. S. BRAVYI, A. W. HARROW, AND A. HASSIDIM, Quantum algorithms for testing properties of distributions, IEEE Trans. Inform. Theory, 57(2011), pp. 3971-3981.
13. A. CHAKRABARTI, G. CORMODE, AND A. MCGREGOR, A near-optimal algorithm for estimating the entropy of a stream, ACM Trans. Algorithms, 6(2010), 51.
14. M. CHARIKAR, S. CHAUDHURI, R. MOTWANI, AND V. R. NARASAYYA, Towards estimation error guarantees for distinct values, in Proceedings of the 19th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000, pp. 268-279.
15. T. COVER AND J. THOMAS, Elements of Information Theory, John Wiley and Sons, New York, 1991.
16. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45(1998), pp. 653-750. (Pubitemid 128488791)
17. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, Random Structures Algorithms, 23(2003), pp. 23-57.
18. S. GUHA, A. MCGREGOR, AND S. VENKATASUBRAMANIAN, Sublinear estimation of entropy and information distances, ACM Trans. Algorithms, 5(2009), 35.
19. P. INDYK AND A. MCGREGOR, Declaring independence via the sketching of sketches, in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 737-745.
20. P. INDYK AND D. WOODRUFF, Tight lower bounds for the distinct elements problem, in Proceedings of the 44th Annual Symposium on Foundations of Computer Science, 2003, pp. 283-288.
21. A. KLINGER, The Vandermonde matrix, Amer. Math. Monthly, 74(1967), pp. 571-574.
22. R. LEVI, D. RON, AND R. RUBINFELD, Testing properties of collections of distributions, in Proceedings of Innovations in Computer Science, 2011, pp. 179-194.
23. 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., 39(2009), pp. 813-842.
24. B. ROOS, On the rate of multivariate Poisson convergence, J. Multivariate Anal., 69(1999), pp. 120-134.
25. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25(1996), pp. 252-271. (Pubitemid 126577271)
26. W. SZPANKOWSKI, Average Case Analysis of Algorithms on Sequences, Wiley, New York, 2001.
27. S. VADHAN, A Study of Statistical Zero-Knowledge Proofs, Ph. D. thesis, MIT, Cambridge, MA, 1999.
28. G. VALIANT AND P. VALIANT, Estimating the unseen: An n/log (n)-sample estimator for entropy, support size, and other distribution properties, with a proof of optimality via two new central limit theorems, in Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011, pp. 685-694.
29. G. VALIANT AND P. VALIANT, The power of linear estimators, in Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, 2011, pp. 403-412.
30. P. VALIANT, Testing symmetric properties of distributions, in Proceedings of the 40th ACM Symposium on Theory of Computing, 2008, pp. 383-392.