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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Simon, H. U. (2006). Spectral norm in learning theory: Some selected topics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4264 LNAI, pp. 13–27). Springer Verlag. https://doi.org/10.1007/11894841_4
Mendeley helps you to discover research relevant for your work.