On the Spectrum of Random Features Maps of High Dimensional Data
Abstract
Random feature maps are ubiquitous in modern statistical machine learning, where they generalize random projections by means of powerful, yet often difficult to analyze nonlinear operators. In this paper we leverage the "concentration" phenomenon induced by random matrix theory to perform a spectral analysis on the Gram matrix of these random feature maps, here for Gaussian mixture models of simultaneously large dimension and size. Our results are instrumental to a deeper understanding on the interplay of the nonlinearity and the statistics of the data, thereby allowing for a better tuning of random feature-based techniques.
Cite
Text
Liao and Couillet. "On the Spectrum of Random Features Maps of High Dimensional Data." International Conference on Machine Learning, 2018.Markdown
[Liao and Couillet. "On the Spectrum of Random Features Maps of High Dimensional Data." International Conference on Machine Learning, 2018.](https://mlanthology.org/icml/2018/liao2018icml-spectrum/)BibTeX
@inproceedings{liao2018icml-spectrum,
title = {{On the Spectrum of Random Features Maps of High Dimensional Data}},
author = {Liao, Zhenyu and Couillet, Romain},
booktitle = {International Conference on Machine Learning},
year = {2018},
pages = {3063-3071},
volume = {80},
url = {https://mlanthology.org/icml/2018/liao2018icml-spectrum/}
}