General bounds on statistical query learning and PAC learning with noise via hypothesis boosting

DOI10.1006/inco.1998.2664zbMath0948.68160OpenAlexW2078000861MaRDI QIDQ1271468

Javed A. Aslam, Scott E. Decatur

Publication date: 10 November 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2047/d20000320

zbMATH Keywords

SQ learning algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items

On the Power of Learning from k-Wise Queries ⋮ A general dimension for query learning ⋮ A complete characterization of statistical query learning with applications to evolvability ⋮ FE-CIDIM: fast ensemble of CIDIM classifiers ⋮ Characterizing Statistical Query Learning: Simplified Notions and Proofs

Cites Work

• On the density of families of sets
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Learning Integer Lattices
• Efficient noise-tolerant learning from statistical queries
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item