Uniform Characterizations of Polynomial-Query Learnabilities

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.

• Type: Conference
• Year: 1998
• Where: DIS
• Authors: Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda
• Keywords: DIS 1998, Equivalence Queries, Exhaustiveness Queries, Polynomial Sized Queries, Theoretical Computer Science