New Computational Paradigms

DOI10.1007/B136981MaRDI QIDQ5717033zbMATH OpenOpenAlexFDO

Authors Ricard Gavaldà

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136981

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Queries and concept learning
• Learning Boolean functions with queries
• scientific article; zbMATH DE number 177810
• A theory of the learnable
• A new abstract combinatorial dimension for exact learning via queries

Cited in

(5)

• Necessary and sufficient conditions for learning with correction queries
• Exact learning of linear combinations of monotone terms from function value queries
• General lower bounds on the query complexity within the exact learning model
• Structural analysis of polynomial-time query learnability
• scientific article; zbMATH DE number 6999904 (Why is no real title available?)

This page was built for publication: New Computational Paradigms

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