PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Spectral Norm in Learning Theory: Some Selected Topics
Hans Simon
Proceedings of ALT 2006 pp. 13-27, 2006.

Abstract

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.

Postscript - Requires a viewer, such as GhostView
EPrint Type:Article
Additional Information:The contents of the paper were presented as invited talk at ALT 2006.
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:2213
Deposited By:Hans Simon
Deposited On:29 September 2006