paper-with-me

홈 › Papers

More Than a Toy: Random Matrix Models Predict How Real-World Neural Representations Generalize

2022-03-11 · Alexander Wei, Wei Hu, Jacob Steinhardt

Of theories for why large-scale machine learning models generalize despite being vastly overparameterized, which of their assumptions are needed to capture the qualitative phenomena of generalization in the real world? On one hand, we find that most theoretical analyses fall short of capturing these qualitative phenomena even for kernel regression, when applied to kernels derived from large-scale neural networks (e.g., ResNet-50) and real data (e.g., CIFAR-100). On the other hand, we find that the classical GCV estimator (Craven and Wahba, 1978) accurately predicts generalization risk even in such overparameterized settings. To bolster this empirical finding, we prove that the GCV estimator converges to the generalization risk whenever a local random matrix law holds. Finally, we apply this random matrix theory lens to explain why pretrained representations generalize better as well as what factors govern scaling laws for kernel regression. Our findings suggest that random matrix theory, rather than just being a toy model, may be central to understanding the properties of neural representations in practice.

📄 PDF Abstract BibTeX arXiv:2203.06176

Code (0)

등록된 구현이 없습니다.

Tasks

regression

Similar Papers 제목 키워드 기반

Sparse Matrix-based Random Projection for Classification

2013-12-12 · Weizhi Lu, Weiyu Li, Kidiyo Kpalma, Joseph Ronsin

As a typical dimensionality reduction technique, random projection can be simply implemented with linear projection, while maintaining the pairwise distances of high-dimensional data with high probability. Considering th…

ClassificationDimensionality Reductionfeature selectionGeneral Classification

Matrix Completion from Power-Law Distributed Samples

2009-12-01 · NeurIPS 2009 12 · Raghu Meka, Prateek Jain, Inderjit S. Dhillon

The low-rank matrix completion problem is a fundamental problem with many important applications. Recently, Candes & Recht, Keshavan et al. and Candes & Tao obtained the first non-trivial theoretical results for the prob…

Low-Rank Matrix CompletionMatrix Completion

Faster Matrix Completion Using Randomized SVD

2018-10-16 · Xu Feng, Wenjian Yu, Yaohang Li

Matrix completion is a widely used technique for image inpainting and personalized recommender system, etc. In this work, we focus on accelerating the matrix completion using faster randomized singular value decompositio…

CPUImage InpaintingMatrix CompletionRecommendation Systems

Efficient Model-Based Collaborative Filtering with Fast Adaptive PCA

2020-09-04 · Xiangyun Ding, Wenjian Yu, Yuyang Xie, Shenghua Liu

A model-based collaborative filtering (CF) approach utilizing fast adaptive randomized singular value decomposition (SVD) is proposed for the matrix completion problem in recommender system. Firstly, a fast adaptive PCA …

Collaborative FilteringMatrix CompletionRecommendation Systems

Effective and Sparse Count-Sketch via k-means clustering

2020-11-24 · YuHan Wang, Zijian Lei, Liang Lan

Count-sketch is a popular matrix sketching algorithm that can produce a sketch of an input data matrix X in O(nnz(X))time where nnz(X) denotes the number of non-zero entries in X. The sketched matrix will be much smaller…

BIG-bench Machine LearningClustering