Symmetric Kernels with Non-Symmetric Data: A Data-Agnostic Learnability Bound
<|reference_start|>Symmetric Kernels with Non-Symmetric Data: A Data-Agnostic Learnability Bound: Kernel ridge regression (KRR) and Gaussian processes (GPs) are fundamental tools in statistics and machine learning with recent applications to highly over-parameterized deep neural networks. The ability of these tools to learn a target function is directly related to the eigenvalues of their kernel sampled on the input data. Targets having support on higher eigenvalues are more learnable. While kernels are often highly symmetric objects, the data is often not. Thus kernel symmetry seems to have little to no bearing on the above eigenvalues or learnability, making spectral analysis on real-world data challenging. Here, we show that contrary to this common lure, one may use eigenvalues and eigenfunctions associated with highly idealized data-measures to bound learnability on realistic data. As a demonstration, we give a theoretical lower bound on the sample complexity of copying heads for kernels associated with generic transformers acting on natural language.<|reference_end|>
@article{lavie2024symmetric,
    title={Symmetric Kernels with Non-Symmetric Data: A Data-Agnostic Learnability
  Bound},
    author={Itay Lavie and Zohar Ringel},
    journal={arXiv preprint arXiv:2406.02663},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.02663},
    primaryClass={stat.ML cond-mat.dis-nn cs.LG}
}