Uniform characterizations of Polynomial-Query learnabilities

Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda

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

5 Citations (Scopus)

Abstract

We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustiveness queries, and their weak (or restricted) versions where no counterexample is returned. For each of all possible combinations of these queries, we uniformly give complete characterizations of boolean concept classes that are learnable using a polynomial number of polynomial sized queries. Our characterizations show the equivalence between the learnability of a concept class C using queries and the existence of a good query for any subset H of C which is guaranteed to reject a certain fraction of candidate concepts in H regardless of the answer. As a special case for equivalence queries alone, our characterizations directly correspond to the lack of the approximate fingerprint property, which is known to be a sufficient and necessary condition for the learnability using equivalence queries.

Original languageEnglish
Title of host publicationDiscovery Science - 1st International Conference, DS 1998, Proceedings
EditorsSetsuo Arikawa, Hiroshi Motoda
PublisherSpringer Verlag
Pages84-92
Number of pages9
ISBN (Print)3540653902, 9783540653905
DOIs
Publication statusPublished - 1998
Event1st International Conference on Discovery Science, DS 1998 - Fukuoka, Japan
Duration: Dec 14 1998Dec 16 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1532
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Discovery Science, DS 1998
CountryJapan
CityFukuoka
Period12/14/9812/16/98

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Uniform characterizations of Polynomial-Query learnabilities'. Together they form a unique fingerprint.

  • Cite this

    Hayashi, Y., Matsumoto, S., Shinohara, A., & Takeda, M. (1998). Uniform characterizations of Polynomial-Query learnabilities. In S. Arikawa, & H. Motoda (Eds.), Discovery Science - 1st International Conference, DS 1998, Proceedings (pp. 84-92). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1532). Springer Verlag. https://doi.org/10.1007/3-540-49292-5_8