Characterizing statistical query learning: simplified notions and proofs

DOI10.1007/978-3-642-04414-4_18MaRDI QIDQ3648752zbMATH OpenOpenAlexFDO

Authors Balázs Szörényi

Publication date 1 December 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-04414-4_18

Mathematics Subject Classification ID

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

Recommendations

• A Characterization of Strong Learnability in the Statistical Query Model
• Efficient noise-tolerant learning from statistical queries
• scientific article; zbMATH DE number 2089365
• Weakly learning DNF and characterizing statistical query learning using Fourier analysis
• New lower bounds for statistical query learning

Cites work

• 10.1162/153244302760200669
• A Characterization of Strong Learnability in the Statistical Query Model
• A Complete Characterization of Statistical Query Learning with Applications to Evolvability
• Efficient noise-tolerant learning from statistical queries
• General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
• scientific article; zbMATH DE number 2080649 (Why is no real title available?)
• Learning by distances
• New lower bounds for statistical query learning
• The complexity of learning concept classes with polynomial general dimension
• Weakly learning DNF and characterizing statistical query learning using Fourier analysis

Cited in

(8)

• General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
• The consistency dimension and distribution-dependent learning from queries.
• On the evolution of monotone conjunctions: drilling for best approximations
• scientific article; zbMATH DE number 2089365 (Why is no real title available?)
• A Characterization of Strong Learnability in the Statistical Query Model
• A complete characterization of statistical query learning with applications to evolvability
• On the Power of Learning from k-Wise Queries
• Polynomial‐time universality and limitations of deep learning

This page was built for publication: Characterizing statistical query learning: simplified notions and proofs

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