Uniform characterizations of polynomial-query learnabilities

DOI10.1016/S0304-3975(02)00177-9MaRDI QIDQ1870533zbMATH OpenOpenAlexFDO

Authors Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, Masayuki Takeda

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)

Recommendations

• scientific article; zbMATH DE number 1263194
• How many queries are needed to learn?
• Queries and concept learning
• The consistency dimension and distribution-dependent learning from queries.
• Publication:4955302

Cites work

• scientific article; zbMATH DE number 1453030 (Why is no real title available?)
• How many queries are needed to learn?
• On the complexity of teaching
• Oracles and queries that are sufficient for exact learning
• Queries and concept learning

Cited in

(5)

• Queries revisited.
• Queries and concept learning
• Structural analysis of polynomial-time query learnability
• scientific article; zbMATH DE number 1453030 (Why is no real title available?)
• scientific article; zbMATH DE number 67615 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870533)