Robert E. Schapire

Calculated based on number of publications stored in Pure and citations from Scopus
1987 …2024

Research activity per year

Filter
Conference contribution

Search results

  • 1993

    Learning sparse multivariate polynomials over a field with queries and counterexamples

    Schapire, R. E. & Sellie, L. M., 1993, Proc 6 Annu ACM Conf Comput Learn Theory. Publ by ACM, p. 17-26 10 p. (Proc 6 Annu ACM Conf Comput Learn Theory).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    26 Scopus citations
  • 1992

    Toward efficient agnostic learning

    Kearns, M. J., Schapire, R. E. & Sellie, L. M., 1992, Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory. Publ by ACM, p. 341-352 12 p. (Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    83 Scopus citations
  • 1990

    Efficient distribution-free learning of probabilistic concepts (abstract)

    Kearns, M. J. & Schapire, R. E., Jul 1 1990, Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990. Association for Computing Machinery, Inc, p. 389 1 p. (Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    13 Scopus citations
  • Exact identification of circuits using fixed points of amplification functions (abstract)

    Goldman, S. A., Kearns, M. J. & Schapire, R. E., Jul 1 1990, Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990. Association for Computing Machinery, Inc, p. 388 1 p. (Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Scopus citations
  • On the sample complexity of weak learning

    Goldman, S. A., Kearns, M. J. & Schapire, R. E., Jul 1 1990, Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990. Association for Computing Machinery, p. 217-231 15 p. (Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Scopus citations
  • Pattern languages are not learnable

    Schapire, R. E., Jul 1 1990, Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990. Association for Computing Machinery, p. 122-129 8 p. (Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    17 Scopus citations
  • 1989

    Inference of finite automata using homing sequences

    Rivest, R. L. & Schapire, R. E., 1989, Proc Twenty First Annu ACM Symp Theory Comput. Publ by ACM, p. 411-420 10 p. (Proc Twenty First Annu ACM Symp Theory Comput).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    89 Scopus citations
  • Learning binary relations and total orders

    Goldman, S. A., Rivest, R. L. & Schapire, R. E., 1989, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 46-51 6 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    15 Scopus citations
  • Strength of weak learnability

    Schapire, R. E., 1989, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 28-33 6 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    42 Scopus citations
  • 1987

    DIVERSITY-BASED INFERENCE OF FINITE AUTOMATA.

    Rivest, R. L. & Schapire, R. E., 1987, Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, p. 78-87 10 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    26 Scopus citations