scientific article; zbMATH DE number 1453030

MaRDI QIDQ4955302zbMATH OpenFDO

Authors José L. Balcázar, Hans Ulrich Simon, Jorge Castro, David Guijarro

Publication date 25 May 2000

zbMATH Keywords

polynomial learnability

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• The consistency dimension and distribution-dependent learning from queries.
• A new abstract combinatorial dimension for exact learning via queries
• Uniform characterizations of polynomial-query learnabilities
• A general dimension for query learning
• Queries revisited.

Cited in

(8)

• A sufficient condition for polynomial distribution-dependent learnability
• A new abstract combinatorial dimension for exact learning via queries
• The consistency dimension and distribution-dependent learning from queries.
• Uniform characterizations of polynomial-query learnabilities
• Polynomial certificates for propositional classes
• A framework for polynomial-time query learnability
• On the Power of Learning from k-Wise Queries
• Algorithmic Learning Theory

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