Computational sample complexity

SIAM Journal on Computing

Volumn 29, Issue 3, 2000, Pages 854-879

  Decatur, Scott E ^a   Goldreich, Oded ^b   Ron, Dana ^c  

^a RUTGERS UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

Author keywords

Computational learning theory; Error correcting codes; Information vs. efficient computation; Pseudorandom functions; Wire tap channel

Indexed keywords

CODES (SYMBOLS); LEARNING SYSTEMS; MEMBERSHIP FUNCTIONS; POLYNOMIALS; SAMPLING;

COMPUTATIONAL SAMPLE COMPLEXITY; ERROR CORRECTING CODES; PSEUDORANDOM FUNCTIONS; WIRE TAP CHANNEL;

COMPUTATIONAL COMPLEXITY;

EID: 0033296083     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797325648     Document Type: Article

References (28)

1. J. ASLAM AND S. DECATUR, On the sample complexity of noise-tolerant learning, Inform. Process. Lett., 57 (1996), pp. 189-195.
2. D. ANGLUIN AND M. KHARITONOV, When won't membership queries help?, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, 1991, pp. 444-453.
3. D. ANGLUIN, Learning regular sets from queries and counterexamples, Inform. and Comput., 75 (1987), pp. 87-106.
4. C. H. BENNETT, G. BRASSARD, C. CRÉPEAU, AND U. MAURER, Generalized privacy amplification, IEEE Trans. Inform. Theory, 41 (1995), pp. 1915-1923.
5. A. BLUMER, A. EHRENFEUCHT, D. HAUSSLER, AND M. K. WARMUTH, Occam's razor, Inform. Process. Lett., 24 (1987), pp. 377-380.
6. A. BLUMER, A. EHRENFEUCHT, D. HAUSSLER, AND M. K. WARMUTH, Learnability and the Vapnik-Chervonenkis dimension, J. ACM, 36 (1989), pp. 929-865.
7. M. BLUM AND S. MICALI, How to generate cryptographically strong sequences of pseudorandom bits, SIAM J. Comput., 13 (1984), pp. 850-864.
8. E. BERLEKAMP AND L. WELCH, Error Correction of Algebraic Block Codes, U.S. Patent 4,633,470, 1986.
9. I. CSISZÁR AND J. KÖRNER, Broadcast channels with confidential messages, IEEE Trans. Inform. Theory, 24 (1978), pp. 339-348.
10. C. CACHIN AND U. M. MAURER, Linking information reconciliation and privacy amplification, J. Cryptology, 10 (1997), pp. 97-110.
11. T. M. COVER AND J. A. THOMAS, Elements of Information Theory, John Wiley, New York, 1991.
12. A. EHRENFEUCHT, D. HAUSSLER, M. KEARNS, AND L. VALIANT, A general lower bound on the number of examples needed for learning, Inform. and Comput., 82 (1989), pp. 247-251.
13. O. GOLDREICH, Foundation of Cryptography - Fragments of a Book, February 1995; revised version, January 1998; http://theory.lcs.mit.edu/∼oded/frag.html.
14. O. GOLDREICH, S. GOLDWASSER, AND S. MICALI, How to construct random functions, J. ACM, 33 (1986) pp. 792-807.
15. J. HÅSTAD, R. IMPAGLIAZZO, L. A. LEVIN, AND M. G. LUBY, A pseudorandom generator from any one-way function, SIAM J. Comput., 28 (1999), pp. 1364-1396.
16. J. JUSTESEN, A class of constructive asymptotically good alegbraic codes, IEEE Trans. Inform. Theory, 18 (1972), pp. 652-656.
17. M. KHARITONOV, Cryptographic hardness of distribution-specific learning, In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, CA, 1993, pp. 372-381.
18. M. J. KEARNS AND L. G. VALIANT, Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM, 41 (1994), pp. 67-95.
19. P. D. LAIRD, Learning from Good and Bad Data, Kluwer Internat. Ser. Engrg. Comput. Sci., Kluwer Academic Publishers, Boston, MA, 1988.
20. U. M. MAURER, Perfect cryptographic security from partially independent channels, in Proceedings of the 23rd Symposium on the Theory of Computing, New Orleans, LA, 1991, pp. 561-571.
21. M. NAOR AND O. REINGOLD, Synthesizers and their application to the parallel construction of pseudo-random functions, in Proceedings of the 36th Symposium on the Foundations of Computer Science, Milwaukee, WI, 1995, pp. 170-181; full version available online from http://www.eccc.uni-trier.de/eccc/.
22. L. PITT AND L. VALIANT, Computational limitations of learning from examples, J. ACM, 35 (1988), pp. 965-984.
23. H. U. SIMON, General bounds on the number of examples needed for learning probabilistic concepts, in Proceedings of the Sixth Annual ACM Workshop on Computational Learning Theory, Santa Cruz, CA, ACM Press, 1993, pp. 402-411.
24. M. TALAGRAND, Sharper bounds for Gaussian and empirical processes, Ann. Probab., 22 (1994), pp. 28-76.
25. L. G. VALIANT, A theory of the learnable, Comm. ACM, 27 (1984), pp. 1134-1142.
26. V. N. VAPNIK AND A. YA. CHERVONENKIS, On the uniform convergence of relative frequencies of events to their probabilities, Theory Probab. Appl., 16 (1971), pp. 264-280.
27. A. D. WYNER, The wire-tap channel, Bell System Tech. J., 54 (1975), pp. 1355-1387.
28. A. C. YAO, Theory and application of trapdoor functions, in Proceedings of the 23rd Symposium on the Foundations of Computer Science, Chicago, IL, 1982, pp. 80-91.