Separating models of learning with faulty teachers

DOI10.1016/j.tcs.2009.01.017zbMath1167.68025OpenAlexW2178978595MaRDI QIDQ1017667

Vitaly Feldman, Shrenik Shah

Publication date: 12 May 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.01.017

zbMATH Keywords

PACexact learningmembership querymodels of learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Uses Software

• McEliece

Cites Work

• How many missing answers can be tolerated by query learners?
• Learning with queries corrupted by classification noise
• Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle
• Queries and concept learning
• 10.1162/153244303768966094
• Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
• Efficient noise-tolerant learning from statistical queries
• A theory of the learnable
• On the inherent intractability of certain coding problems (Corresp.)
• Learning Decision Trees Using the Fourier Spectrum
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Noise-tolerant learning, the parity problem, and the statistical query model
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item