Uniform characterizations of polynomial-query learnabilities

Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda

研究成果: Contribution to journalArticle査読

抄録

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 script C sign using queries and the existence of a good query for any subset H of script C sign 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.

本文言語英語
ページ(範囲)377-385
ページ数9
ジャーナルTheoretical Computer Science
292
2
DOI
出版ステータス出版済み - 1 27 2003

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Uniform characterizations of polynomial-query learnabilities」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル