scientific article; zbMATH DE number 177810

MaRDI QIDQ4038688zbMATH OpenFDO

Authors Osamu Watanabe

Publication date 18 May 1993

zbMATH Keywords

bounded learningcomputational complexity of learning problemscomputational power of polynomial time lemmasexact learninglearning systempolynomial time learnabilityrepetitive setsrepresentation classstructure of complexity classes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A framework for polynomial-time query learnability
• Structural analysis of polynomial-time query learnability
• The consistency dimension and distribution-dependent learning from queries.
• Queries and concept learning
• How many queries are needed to learn?

Cited in

(16)

• The query complexity of learning DFA
• Exact learning via teaching assistants
• Learning elementary formal systems with queries.
• A general comparison of language learning from examples and from queries
• scientific article; zbMATH DE number 67621 (Why is no real title available?)
• A framework for polynomial-time query learnability
• Structural analysis of polynomial-time query learnability
• scientific article; zbMATH DE number 1946973 (Why is no real title available?)
• scientific article; zbMATH DE number 2068174 (Why is no real title available?)
• On the complexity of small description and related topics
• Algorithmic Learning Theory
• New Computational Paradigms
• Algorithmic Learning Theory
• Monotone term decision lists
• The complexity of learning minor closed graph classes
• On learning from queries and counterexamples in the presence of noise

This page was built for publication:

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