A Characterization of Strong Learnability in the Statistical Query Model

DOI10.1007/978-3-540-70918-3_34MaRDI QIDQ3590951zbMATH OpenOpenAlexFDO

Authors Hans Ulrich Simon

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_34

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational learning theory (68Q32)

Recommendations

• Characterizing statistical query learning: simplified notions and proofs
• scientific article; zbMATH DE number 2089365
• New lower bounds for statistical query learning
• A complete characterization of statistical query learning with applications to evolvability
• Efficient noise-tolerant learning from statistical queries

Cited in

(7)

• General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
• New lower bounds for statistical query learning
• The consistency dimension and distribution-dependent learning from queries.
• scientific article; zbMATH DE number 2089365 (Why is no real title available?)
• Characterizing statistical query learning: simplified notions and proofs
• A complete characterization of statistical query learning with applications to evolvability
• Realizable learning is all you need

This page was built for publication: A Characterization of Strong Learnability in the Statistical Query Model

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