Attribute-efficient and non-adaptive learning of parities and DNF expressions

Journal of Machine Learning Research

Volumn 8, Issue , 2007, Pages 1431-1460

  Feldman, Vitaly ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Attribute efficient; DNF; Membership query; Non adaptive; Parity function; Random linear code

Indexed keywords

ATTRIBUTE-EFFICIENT; MEMBERSHIP QUERY; PARITY FUNCTION;

MEMBERSHIP FUNCTIONS; PROBLEM SOLVING; QUERY LANGUAGES; RANDOM PROCESSES;

ADAPTIVE ALGORITHMS;

EID: 34547668404     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (51)

1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley, 1974.
2. D. Angluin and P. Laird. Learning from noisy examples. Machine Learning, 2:343-370, 1988.
3. A. Barg. Complexity issues in coding theory. Electronic Colloquium on Computational Complexity (ECCC), 4(046), 1997.
4. A. Blum, L. Hellerstein, and N. Littlestone. Learning in the presence of finitely or infinitely many irrelevant attributes. Journal of Computer and System Sciences, 50:32-40, 1995.
5. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. In Proceedings of STOC, pages 435-440, 2000.
6. N. Bshouty and V. Feldman. On using extended statistical queries to avoid membership queries. Journal of Machince Learning Research, 2:359-395, 2002.
7. N. Bshouty and L. Hellerstein. Attribute efficient learning with queries. Journal of Computer and System Sciences, 56:310-319, 1998.
8. N. Bshouty, J. Jackson, and C. Tamon. More efficient PAC learning of DNF with membership queries under the uniform distribution. In Proceedings of COLT, pages 286-295, 1999.
9. N. Bshouty, E. Mossel, R. O'Donnell, and R. Servedio. Learning DNF from random walks. In Proceedings of FOCS, pages 189-199, 2003.
10. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist., 23:493-507, 1952.
11. J. Cooley and J. Tukey. An Algorithm for the Machine Calculation of Complex Fourier Series. Math. Computat., 19:297-301, 1965.
12. P. Damaschke. Adaptive versus nonadaptive attribute-efficient learning. In Proceedings of STOC, pages 590-596, 1998.
13. S. Decatur, O. Goldreich, and D. Ron. Computational sample complexity. SIAM Journal on Computing, 29(3):854-879, 1999.
14. M. Farach, S. Kannan, E. Knill, and S. Muthukrishnan. Group testing problems in experimental molecular biology. In Proceedings of Sequences '97, 1997.
15. V. Feldman, P. Gopalan, S. Khot, and A. Ponuswami. New Results for Learning Noisy Parities and Halfspaces. In Proceedings of FOCS, pages 563-574, 2006.
16. Y. Freund. Boosting a weak learning algorithm by majority. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 202-216, 1990.
17. Y. Freund. An improved boosting algorithm and its implications on learning complexity. In Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pages 391-398, 1992.
18. D. Gavinsky. Optimally-smooth adaptive boosting and application to agnostic learning. Journal of Machine Learning Research, 4:101-117, 2003.
19. S. Goldman, M. Kearns, and R. Schapire. Exact identification of read-once formulas using fixed points of amplification functions. SIAM Journal on Computing, 22(4):705-726, 1993.
20. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of STOC, pages 25-32, 1989.
21. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792-807, 1986.
22. D. Guijarro, V. Lavin, and V. Raghavan. Exact learning when irrelevant variables abound. In Proceedings of Euro COLT '99, pages 91-100, 1999a.
23. D. Guijarro, J. Tarai, and T. Tsukiji. Finding relevant variables in PAC model with membership queries. Lecture Notes in Artificial Intelligence, 1720:313-322, 1999b.
24. D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78-150, 1992.
25. T. Hofmeister. An application of codes to attribute-efficient learning. In Proceedings of EuroCOLT, pages 101-110, 1999.
26. J. Jackson. Personal communication, 2004.
27. J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. Journal of Computer and System Sciences, 55:414-440, 1997.
28. J. Jackson, E. Shamir, and C. Shwartzman. Learning with queries corrupted by classification noise. In Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems, pages 45-53, 1997.
29. M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6): 983-1006, 1998.
30. M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM, 41(1):67-95, 1994.
31. M. Kearns and U. Vazirani. An introduction to computational learning theory. MIT Press, Cambridge, MA, 1994.
32. M. Kearns, R. Schapire, and L. Sellie. Toward efficient agnostic learning. Machine Learning, 17 (2-3):115-141, 1994.
33. A. Klivans and R. Servedio. Boosting and hard-core set construction. Machine Learning, 51(3): 217-238, 2003.
34. A. Klivans and R. Servedio. Toward attribute efficient learning of decision lists and parities. In Proceedings of COLT, pages 234-248, 2004.
35. E. Kushilevitz and Y. Mansour. Learning decision trees using the Fourier spectrum. In Proceedings of STOC, pages 455-464, 1991.
36. L. Levin. Randomness and non-determinism. Journal of Symbolic Logic, 58(3): 1102-1103, 1993.
37. Y. Mansour. Learning boolean functions via the fourier transform. In V. P. Roychodhury, K. Y. Siu, and A. Orlitsky, editors, Theoretical Advances in Neural Computation and Learning, pages 391-424. Kluwer, 1994.
38. J. Massey. Shift-register synthesis and BCH decoding. IEEE Trans. Inform. Theory, 15:122-127, 1969.
39. R. J. McEliece. A public-key cryptosystem based on algebraic coding theory. DSNprogress report, 42-44, 1978.
40. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
41. R. Schapire. The strength of weak learnability. Machine Learning, 5(2): 197-227, 1990.
42. R. Servedio. Computational sample complexity and attribute-efficient learning. Journal of Computer and System Sciences, 60(1):161-178, 2000.
43. R. Servedio. Smooth boosting and learning with malicious noise. Journal of Machine Learning Research, 4:633-648, 2003.
44. M. Sudan. Essential coding theory (lecture notes). Available at http://theory.lcs.mit.edu/~madhu/FT02/, 2002.
45. R. Uehara, K. Tsuchida, and I. Wegener. Optimal attribute-efficient learning of disjunction, parity, and threshold functions. In Proceedings of EuroCOLT'97, pages 171-184, 1997.
46. L. Valiant. A neuroidal architecture for cognitive computation. Journal of the ACM, 47(5):854-882, 2000.
47. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
48. L. Valiant. Circuits of the Mind. Oxford University Press, 1994.
49. L. G. Valiant. Knowledge infusion. In Proceedings of AAAI, 2006.
50. J.H. van Lint. Introduction to Coding Theory. Springer, Berlin, 1998.
51. A. Vardy. Algorithmic complexity in coding theory and the minimum distance problem. In Proceedings of STOC, pages 92-109, 1997.