Uniform characterizations of polynomial-query learnabilities

DOI10.1016/S0304-3975(02)00177-9zbMath1026.68072OpenAlexW2091918429MaRDI QIDQ1870533

Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda, Yosuke Hayashi

Publication date: 14 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00177-9

zbMATH Keywords

concept learninglearning from examplespolynomial-query learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

Queries revisited.

Cites Work

• Unnamed Item
• On the complexity of teaching
• Oracles and queries that are sufficient for exact learning
• Queries and concept learning
• How many queries are needed to learn?

This page was built for publication: Uniform characterizations of polynomial-query learnabilities