On Learning Correlated Boolean Functions Using Statistical Queries (Extended Abstract)
- 31 October 2001
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Quantum lower bounds by quantum argumentsPublished by Association for Computing Machinery (ACM) ,2000
- Noise-tolerant learning, the parity problem, and the statistical query modelPublished by Association for Computing Machinery (ACM) ,2000
- Efficient noise-tolerant learning from statistical queriesJournal of the ACM, 1998
- A Polynomial-Time Algorithm for Learning Noisy Linear Threshold FunctionsAlgorithmica, 1998
- General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis BoostingInformation and Computation, 1998
- Learning Sparse Multivariate Polynomials over a Field with Queries and CounterexamplesJournal of Computer and System Sciences, 1996
- Randomized AlgorithmsPublished by Cambridge University Press (CUP) ,1995
- Weakly learning DNF and characterizing statistical query learning using Fourier analysisPublished by Association for Computing Machinery (ACM) ,1994
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- A theory of the learnableCommunications of the ACM, 1984