The spectrum of kernel random matrices

By Noureddine El Karoui. 2010

243 citations recorded by the source corpus.

We place ourselves in the setting of high-dimensional statistical inference where the number of variables p in a dataset of interest is of the same order of magnitude as the number of observations n. We consider the spectrum of certain kernel random matrices, in particular n x n matrices whose (i, j)th entry is f (X' i X j /p) or f (∥X i - X j ∥ 2 /p) where p is the dimension of the data, and X i are independent data vectors. Here f is assumed to be a locally smooth function. The study is motivated by questions arising in statistics and computer science where these matrices are used to perform, among other things, nonlinear versions of principal component analysis. Surprisingly, we show that in high-dimensions, and for the models we analyze, the problem becomes essentially linear—which is at odds with heuristics sometimes used to justify the usage of these methods. The analysis also highlights certain peculiarities of models widely studied in random matrix theory and raises some questions about their relevance as tools to model high-dimensional data encountered in practice.

Subfields: Computational Theory and Mathematics, Statistics and Probability

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Xiuyuan Cheng
  2. Andrea Montanari
  3. Debashis Paul
  4. Tengyuan Liang
  5. Alexander Aue
  6. Amit Singer
  7. Alexander Rakhlin
  8. Florent Krzakala

In Statistics and Probability

  1. Andrea Montanari
  2. Alexander Aue
  3. Debashis Paul
  4. Tengyuan Liang
  5. Taiji Suzuki
  6. Zhou Fan
  7. Florent Krzakala
  8. Sebastian Goldt

Citations in the corpus