scientific article; zbMATH DE number 1263194

MaRDI QIDQ4234065zbMATH OpenFDO

Authors Krishnan Pillaipakkamnatt, Dawn Wilkins, Lisa Hellerstein, Vijay Raghavan

Publication date 3 February 2002

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• How many queries are needed to learn?
• Complexity theoretic hardness results for query learning
• Oracles and queries that are sufficient for exact learning

Cited in

(18)

• Complexity theoretic hardness results for query learning
• The forbidden projections of unate functions
• Query complexity of membership comparable sets.
• Uniform characterizations of polynomial-query learnabilities
• When won't membership queries help?
• Oracles and queries that are sufficient for exact learning
• Polynomial certificates for propositional classes
• scientific article; zbMATH DE number 2089366 (Why is no real title available?)
• scientific article; zbMATH DE number 2089369 (Why is no real title available?)
• 10.1162/153244304322972676
• The complexity of exactly learning algebraic concepts
• How many queries are needed to learn?
• scientific article; zbMATH DE number 1966613 (Why is no real title available?)
• scientific article; zbMATH DE number 1563912 (Why is no real title available?)
• On the exact learnability of graph parameters: the case of partition functions
• On the structure of learnability beyond P/poly
• On the limits of proper learnability of subclasses of DNF formulas
• The complexity of learning concept classes with polynomial general dimension

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 Q4234065)