Maximizing agreements and coagnostic learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2533, Issue , 2002, Pages 83-97

  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

APPROXIMATION ALGORITHMS; BOOLEAN ALGEBRA; GEOMETRY;

AGNOSTIC LEARNING; AGREEMENT PROBLEMS; BOOLEAN DOMAIN; BOOLEAN FORMULAE; COAGNOSTIC LEARNING; DECISION LISTS; MAXIMIZING AGREEMENTS; MULTIVARIATE POLYNOMIAL;

LEARNING ALGORITHMS;

EID: 4544368467     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36169-3_9     Document Type: Conference Paper

References (13)

1. E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations, Theoretical Computer Science, 147: 181-210, 1995.
2. D. Angluin and P. D. Laird, Learning from noisy examples, ML, 2:343-370,1988.
3. M. Anthony and N. Biggs, Computational learning theory, Cambridge Tracts in Theoretical Computer Science 30, Cambridge University Press, 1992.
4. N. H. Bshouty, L. Burroughs. Bounds for the Minimum Disagreement Problem with Applications to Learning Theory. 15th COLT, 271-286, 2002.
5. S. Ben-David, N. Eiron, P. M. Long. On the difficulty of approximately maximizing agreement. 13th COLT, 266-274, 2000.
6. J. Hastad, Some optimal inapproximability results, 29th STOC, 1-10, 1997.
7. D. Haussler, Decision theoretic generalizations of the PAC model for neural net and other learning applications. Inform. Comput., 100(1):78-150, Sept. 1992.
8. Klaus-U Höffgen, Hans-U. Simon and Kevin S. Van Horn, Robust trainability of single neurons, JCSS, 50(1): 114-125, 1995.
9. M. Kearns and M. Li, Learning in the presence of malicious errors, SIAM Journal on Computing, 22(4): 807-837, 1993.
10. M. Kearns, R. E. Schapire and L. M. Sellie. Toward efficient agnostic learning. 5th COLT, 341-352, 1992.
11. Y. Mansour, Learning Boolean Functions via the Fourier Transform. In Theoretical Advances in Neural Computation and Learning, (V. P. Roychodhury, K-Y. Siu and A. Orlitsky, ed), 391-424 (1994).
12. L. G. Valiant, A theory of the learnable, Comm. ofthe ACM, 27(11): 1134-1142, 1984.
13. V. Vapnik, A. Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities. Theory ofPr obability and its Applications, 16(2): 264-280, 1971