Learning attribute-efficiently with corrupt oracles

DOI10.1016/j.tcs.2007.07.040zbMath1143.68021OpenAlexW2134482306MaRDI QIDQ2465035

Nader H. Bshouty, Rotem Bennet

Publication date: 19 December 2007

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

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

zbMATH Keywords

learningqueriesoraclesattribute efficientcorruptEXACTmonotone theory

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• On learning from queries and counterexamples in the presence of noise
• Learning regular sets from queries and counterexamples
• Attribute-efficient learning in query and mistake-bound models
• Simple learning algorithms using divide and conquer
• Malicious omissions and errors in answers to membership queries
• Learning in the presence of finitely or infinitely many irrelevant attributes
• Projection learning
• Learning with errors in answers to membership queries
• Exact learning Boolean functions via the monotone theory
• Learning read-once formulas with queries

This page was built for publication: Learning attribute-efficiently with corrupt oracles