Communications of the ACM
Probabilistic communication complexity
Journal of Computer and System Sciences
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Information and Computation
Efficient noise-tolerant learning from statistical queries
Journal of the ACM (JACM)
A linear lower bound on the unbounded error probabilistic communication complexity
Journal of Computer and System Sciences - Complexity 2001
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
On Learning Correlated Boolean Functions Using Statistical Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
New Lower Bounds for Statistical Query Learning
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
New Lower Bounds for Statistical Query Learning
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Noise-tolerant learning, the parity problem, and the statistical query model
Journal of the ACM (JACM)
Threshold circuit lower bounds on cryptographic functions
Journal of Computer and System Sciences
Computational Complexity
A characterization of strong learnability in the statistical query model
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
| Hi-index | 0.00 |
In this paper, we review some known results that relate the statistical query complexity of a concept class to the spectral norm of its correlation matrix. Since spectral norms are widely used in various other areas, we are then able to put statistical query complexity in a broader context. We briefly describe some non-trivial connections to (seemingly) different topics in learning theory, complexity theory, and cryptography. A connection to the so-called Hidden Number Problem, which plays an important role for proving bit-security of cryptographic functions, will be discussed in somewhat more detail.