Bounds for the minimum disagreement problem with applications to learning theory

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2375, Issue , 2002, Pages 271-286

  Bshouty, Nader H ^a   Burroughs, Lynn ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

AGNOSTIC LEARNING; DECISION LISTS; EXCLUSIVE-OR; HALF SPACES; LEARNING THEORY; MULTIVARIATE POLYNOMIAL; PAC LEARNING;

COMPUTATION THEORY;

EID: 29144432674     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-45435-7_19     Document Type: Conference Paper

References (21)

1. [AL88] D. Ang luin and P.D. Laird, Learning from noisy examples, Machine Learning, 2:343-370,1988.
2. [ABSS97] S. Arora, L.B abai, J. Stern and Z. Sweedyk, Hardness of approximate optima in lattices, codes, and systems of linear equations, JCSS 54(2): 317-331, 1997.
3. [BB99] P.L.B arlett, S.B en-David. Hardness results for neural network approximation problems. 4th Euro-COLT, 50-62, 1999.
4. [BEL00] S. Ben-David, N.E iron, P.M. Long. On the difficulty of approximately maximizing agreement. 13th COLT, 266-274, 2000.
5. [BK01] P. Berman and M. Karpinski.A pproximating minimal unsatisfiability of linear equations, Manuscript.F rom ECCC reports 2001, TR01-025.
6. [BB02] N. H.B shouty and L.B urroughs.M aximizing Agreements, CoAgnostic Learning and Weak Agnostic Learning. Manuscript, 2002.
7. [F96] U.F eige, A threshold of log n for approximating set cover, 28th STOC, 314-318, 1996.
8. [GJ79] M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the theory of NP-Completeness. W.H.F reeman, 1979.
9. [H97] J. Håstad, Some optimal inapproximability results, 29th STOC, 1-10, 1997.
10. [Ha92] D.H aussler, Decision theoretic generalization of the PAC model for neural net and other learning applications. Inform. Comput., 100(1):78-150, Sept. 1992.
11. [HSV95] Klaus-U Höffgen, Hans-U. Simon and Kevin S. Van Horn, Robust trainability of single neurons, J. of Comput. Syst. Sci., 50(1): 114-125, 1995.
12. [KMS94] D. Karger, R.M otwani, and M. Sudan, Approximate graph coloring by semidefinite programming. 35th FOCS, 2-13, 1994.
13. [KL93] M.K earns and M. Li, Learning in the presence of malicious errors, SIAM Journal on Computing, 22(4): 807-837, 1993.
14. [KLPV87] M.K earns, M. Li, L. Pit t and L.V aliant. On the learnability of Boolean formulae, 19th STOC, 285-295, 1987.
15. [KSS92] M.K earns, R.E.S chapire and L.M. Sellie. Toward efficient agnostic learning. 5th COLT, 341-352, 1992.
16. [KLS93] S.K hanna, N.L inial and S. Safra. On the hardness of approximating the chromatic number, Proc. 2nd Israel Symp. on Theory of Computing and Systems, 250-260, 1993.
17. [K00] C.K uhlmann. Harness Results for General Two-Layer Neural Networks. 13th COLT, 275-285, 2000.
18. [M94] Y. Mansour, Learning Boolean Functions via the Fourier Transform. In Theoretical Advances in Neural Computation and Learning, (V. P. Roychodhury, K-Y.S iu and A. Orlitsky, ed), 391-424 (1994).
19. [PV88] L. Pitt and L.G.V aliant, Computational Limitation on Learning from Examples. JACM, 35, (4): 965-984, 1988.
20. [Raz95] R.R az, A parallel repetition theorem. 27th STOC, 447-456, 1995.
21. [S01] H.U. Simon, private communication, 2001.