On learning correlated Boolean functions using statistical queries (extended abstract)

DOI10.1007/3-540-45583-3_7MaRDI QIDQ4473543zbMATH OpenFDO

Authors Ke Yang

Publication date 4 August 2004

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

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

Mathematics Subject Classification ID

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

Recommendations

• Noise-tolerant learning, the parity problem, and the statistical query model
• Noise-tolerant learning, the parity problem, and the statistical query model
• New lower bounds for statistical query learning
• New lower bounds for statistical query learning
• Efficient noise-tolerant learning from statistical queries

Cited in

(8)

• New lower bounds for statistical query learning
• Uniform-distribution attribute noise learnability
• On using extended statistical queries to avoid membership queries
• Characterizing statistical query learning: simplified notions and proofs
• Derandomized learning of Boolean functions over finite abelian groups
• Gradient descent fails to learn high-frequency functions and modular arithmetic
• Sampling without compromising accuracy in adaptive data analysis
• Almost pairwise independence and resilience to deep learning attacks

This page was built for publication: On learning correlated Boolean functions using statistical queries (extended abstract)

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