On learning correlated boolean functions using statistical queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2225, Issue , 2001, Pages 59-76

  Yang, Ke ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; STATISTICS;

FINITE FIELDS; HARDNESS OF LEARNING; HIGHLY-CORRELATED; LINEAR FUNCTIONS; LINEAR THRESHOLD FUNCTIONS; PARITY FUNCTIONS; STATISTICAL QUERIES; TARGET FUNCTIONS;

LEARNING ALGORITHMS;

EID: 84948123449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45583-3_7     Document Type: Conference Paper

References (14)

1. Andris Ambainis. Quantum lower bounds by quantum arguments, In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 636-643, 2000.
2. Javed Aslam and Scott Decatur. General Bounds on Statistical Query Learning and PAC learning with Noise via Hypothesis Boosting, In Information and Computation, 141, pages 85-118 (1998).
3. Leemon Baird. Blind Computation. Manuscript, 2001.
4. Avrim Blum, Merrick Furst, Jeffrey Jackson, Michael Kearns, Yishay Mansour, and Steven Rudich. Weakly Learning DNF and Characterizing Statistical Query Learning Using Fourier Analysis. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 253-262, 1994.
5. Avrim Blum, Alan Frieze, Ravi Kannan, and Santosh Vempala, A Polynomial-time Algorithm for Learning Noisy Linear Threshold Functions, In Algorithmica, 22:35-52, 1998. An extended abstract appears in Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS’96), pages 330-338.
6. Avrim Blum, Adam Kalai and Hal Wasserman, Noise-tolerant Learning, the Parity problem, and the Statistical Query model. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 435-440, 2000.
7. Scott Decatur, Efficient Learning from Faulty Data. Ph.D. Thesis, Harvard University, TR-30-95, 1995.
8. Oded Goldreich and Leonid Levin, A hard-core predicate for all one-way functions. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 25-32, 1989.
9. Jeff Jackson On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries. In Proceedings of the 13th Annual Workshop on Computational Learning Theory, 2000.
10. Michael Kearns. Efficient noise-tolerant learning from statistical queries. In Journal of the ACM, 45(6), pp. 983-1006, 1998. Preliminary version in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 392-401, 1993.
11. Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
12. Robert Schapire and Linda Selle, Learning Sparse Multivariate Polynomials over a Field with Queries and Counterexamples. In Journal of Computer and System Sciences, 52, 201-213, 1996.
13. Salil Vadhan, Private Communication.
14. Leslie Valiant, A theory of the Leanable. In Communications of the ACM, 27(11): 1134-1142, November 1984.