mlsanityData to 14 Oct 2026

Estimating the Spectral Moments of the Kernel Integral Operator from Finite Sample Matrices

arXiv 2410.17998 ↗First posted 23 Oct 2024cs.LG math.SP math.STcited by 2

Not on the map. Why?

Abstract (arXiv)

Analyzing the structure of sampled features from an input data distribution is challenging when constrained by limited measurements in both the number of inputs and features. Traditional approaches often rely on the eigenvalue spectrum of the sample covariance matrix derived from finite measurement matrices; however, these spectra are sensitive to the size of the measurement matrix, leading to biased insights. In this paper, we introduce a novel algorithm that provides unbiased estimates of the spectral moments of the kernel integral operator in the limit of infinite inputs and features from finitely sampled measurement matrices. Our method, based on dynamic programming, is efficient and capable of estimating the moments of the operator spectrum. We demonstrate the accuracy of our estimator on radial basis function (RBF) kernels, highlighting its consistency with the theoretical spectra. Furthermore, we showcase the practical utility and robustness of our method in understanding the geometry of learned representations in neural networks.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 38 references that are in the map. First posted on arXiv 23 Oct 2024.

Builds on

21 of 38 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  3. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 466
  4. 2021Random Feature Attentioncited by 354
  5. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 290
  6. 2022Tensor Programs V: Tuning Large Neural Networks via Zero-Shot Hyperparameter Transfercited by 288
  7. 2018Implicit Self-Regularization in Deep Neural Networks: Evidence from Random Matrix Theory and Implications for Learningcited by 215
  8. 2020Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networkscited by 166
  9. 2016Generalization Properties of Learning with Random Featurescited by 164
  10. 2015On the Equivalence between Kernel Quadrature Rules and Random Feature Expansionscited by 138
  11. 2022Self-Consistent Dynamical Field Theory of Kernel Evolution in Wide Neural Networkscited by 105
  12. 2016Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regressioncited by 64
9 more
  1. 2017Classification and Geometry of General Perceptual Manifoldscited by 62
  2. 2021Separation of Scales and a Thermodynamic Description of Feature Learning in Some CNNscited by 53
  3. 2023Feature-Learning Networks Are Consistent Across Widths At Realistic Scalescited by 41
  4. 2022Information Theory with Kernel Methodscited by 37
  5. 2020Finding Global Minima via Kernel Approximationscited by 23
  6. 2021A theory of representation learning gives a deep generalisation of kernel methodscited by 15
  7. 2023A Spectral Theory of Neural Prediction and Alignmentcited by 14
  8. 2016Spectrum Estimation from Samplescited by 10
  9. 2021Sublinear Time Eigenvalue Approximation via Random Samplingcited by 7

Built on by

Cited by year

Citing papers per year: 2025: 2.

2 papers.