scientific article; zbMATH DE number 2089365

MaRDI QIDQ3046709zbMATH OpenFDO

Authors Ke Yang

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2375/23750229.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• New lower bounds for statistical query learning
• A Characterization of Strong Learnability in the Statistical Query Model
• Lower bounds on learning random structures with statistical queries
• General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
• Characterizing statistical query learning: simplified notions and proofs

Cited in

(10)

• A Characterization of Strong Learnability in the Statistical Query Model
• scientific article; zbMATH DE number 2080649 (Why is no real title available?)
• General lower bounds on the query complexity within the exact learning model
• A complete characterization of statistical query learning with applications to evolvability
• Dealing with range anxiety in mean estimation via statistical queries
• General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
• Characterizing statistical query learning: simplified notions and proofs
• New lower bounds for statistical query learning
• Lower bounds on learning random structures with statistical queries
• scientific article; zbMATH DE number 1804123 (Why is no real title available?)

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