Uniform characterizations of polynomial-query learnabilities

DOI10.1016/S0304-3975(02)00177-9zbMATH Open1026.68072OpenAlexW2091918429MaRDI QIDQ1870533FDOQ1870533

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

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

zbMATH Keywords

concept learninglearning from examplespolynomial-query learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Queries and concept learning
• Oracles and queries that are sufficient for exact learning
• How many queries are needed to learn?
• On the complexity of teaching
• Title not available (Why is that?)

Cited In (4)

• Queries revisited.
• Structural analysis of polynomial-time query learnability
• Title not available (Why is that?)
• Title not available (Why is that?)

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)