Testing monotone high-dimensional distributions

Random Structures and Algorithms

Volumn 34, Issue 1, 2009, Pages 24-44

  Rubinfeld, Ronitt ^a   Servedio, Rocco A ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

Distribution testing; Monotone distributions; Property testing; Sublinear algorithms

Indexed keywords

EID: 60349102466     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20247     Document Type: Article

References (14)

1. D. Aldous, On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing, Probab Eng Informat Sci 1 (1987), 33-46.
2. T. Batu, S. Dasgupta, R. Kumar, and R. Rubinfeld, The complexity of approximating entropy, In ACM Symposium on Theory of Computing, 2002, pp. 678-687.
3. T. Batu, E. Fischer, L. Fortnow, R. Kumar, R. Rubinfeld, and P. White, Testing random variables for independence and identity, In IEEE Symposium on Foundations of Computer Science, 2001, pp. 442-451.
4. T. Batu, L. Fortnow, R. Rubinfeld, W D. Smith, and P. White, Testing that distributions are close, In IEEE Symposium on Foundations of Computer Science, 2000, pp. 259-269.
5. T. Batu, R. Kumar, and R. Rubinfeld, Sublinear algorithms for testing monotone and unimodal distributions, In ACM Symposium on Theory of Computing, 2004, pp. 381-390.
6. 0 functions, In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991, pp. 317-325.
7. O. Goldreich and D. Ron, On testing expansion in bounded-degree graphs, Electron Colloq Comput Complexity 7 (2000), no. 20.
8. W. C. Huffman and V. Pless, Fundamentals of error correcting codes, Cambridge University Press, Cambridge, 2003.
9. M. Kearns and U. Vazirani, An introduction to computational learning theory, MIT Press, Cambridge, MA, 1994.
10. N. Linial, Y. Mansour, and N. Nisan, Constant depth circuits, Fourier transform and learnability, J ACM 40 (1993), 607-620.
11. R. Motwani and P. Raghavan, Randomized algorithms, Cambridge University Press, New York, NY, 1995.
12. R. Rubinfeld and R. Servedio, Testing monotone high-dimensional distributions, In ACM Symposium on Theory of Computing, 2005, pp. 147-156.
13. R. Servedio, On learning monotone DNF under product distributions, In Proceedings of the 14th ACM Conference on Computational Learning Theory, 2001, pp. 473-489.
14. A. Yao, Probabilistic computations: Towards a unified measure of complexity, In Symposium on Foundations of Computer Science, 1977, pp. 222-227.