Finding correlations in subquadratic time, with applications to learning parities and juntas

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2012, Pages 11-20

  Valiant, Gregory ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

closest pair; Correlation; learning juntas; learning parity with noise; locality sensitive hashing; metric embedding; nearest neighbor

Indexed keywords

CLOSEST PAIR; LEARNING JUNTAS; LEARNING PARITY WITH NOISE; LOCALITY SENSITIVE HASHING; METRIC EMBEDDINGS; NEAREST NEIGHBORS;

COMPUTER SCIENCE; HAMMING DISTANCE; NOISE POLLUTION; OPTICAL CORRELATION; VECTORS;

LEARNING ALGORITHMS;

EID: 84871971939     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2012.27     Document Type: Conference Paper

References (20)

1. N. Alon and A. Naor. Approximating the cut-norm via Grothendiecks inequality. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 72-80, 2004.
2. A. Andoni and P. Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 459-468, 2006.
3. A. Blum, M. Furst, J. Jackson, M. Kearns, Y. Mansour, and S. Rudich. Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 253-262, 1994.
4. A. Blum, A. Kalai, and H. Wasserman. Noise-tolerant learning, the parity problem, and the statistical query model. Journal of the ACM (JACM), 50(4):507-519, 2003.
5. D. Coppersmith. Rectangular matrix multiplication revisited. Journal of Complexity, 13(1):42-49, 1997.
6. M. Dubiner. Bucketing coding and information theory for the statistical high dimensional nearest neighbor problem. CoRR, abs/0810.4182, 2008.
7. V. Feldman, P. Gopalan, S. Khot, and A. Ponnuswami. New results for learning noisy parities and halfspaces. In IEEE Symposium on Foundations of Computer Science (FOCS), 2006.
8. E. Grigorescu, L. Reyzin, and S. Vempala. On noise-tolerant learning of sparse parities and related problems. In The 22nd International Conference on Algorithmic Learning Theory (ALT), 2011.
9. N. J. Hopper and A. Blum. Secure human identification protocols. In ASIACRYPT, pages 52-66, 2001.
10. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 248-253, 1989.
11. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 1998.
12. V. Lyubashevsky. The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem. In RANDOM, pages 378-389, 2005.
13. E. Mossel, R. O'Donnell, and R. Servedio. Learning functions of k relevant variables. Journal of Computer and System Sciences, 69(3):421-434, 2004.
14. R. Pagh. Compressed matrix multiplication. In "Innovations in Theoretical Computer Science (ITCS)", 2012.
15. Ramamohan Paturi, Sanguthevar Rajasekaran, and John H. Reif. The light bulb problem. In Conference on Learning Theory (COLT), pages 261-268, 1989.
16. T.J. Rivlin. The Chebyshev Polynomials. John Wiley and Sons, 1974.
17. I.J. Schoenberg. Positive definite functions on spheres. Duke Mathematical Journal, 9(1):96-108, 1942.
18. L. Valiant. Functionality in neural nets. In First Workshop on Computational Learning Theory, pages 28-39, 1988.
19. K. A. Verbeurgt. Learning DNF under the uniform distribution in quasipolynomial time. In Conference on Learning Theory (COLT), pages 314-326, 1990.
20. V. Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd. In Proceedings of the ACM Symposium on Theory of Computing (STOC), 2012.