Accurate error bounds for the eigenvalues of the kernel matrix
From MaRDI portal
Recommendations
Cited in
(21)- The smallest eigenvalues of random kernel matrices: asymptotic results on the min kernel
- Adaptive estimation of nonparametric geometric graphs
- A comparative analysis of optimization and generalization properties of two-layer neural network and random feature models under gradient descent dynamics
- Discovering model structure for partially linear models
- Statistical properties of kernel principal component analysis
- Concentration of kernel matrices with application to kernel spectral clustering
- Universally consistent vertex classification for latent positions graphs
- scientific article; zbMATH DE number 3967045 (Why is no real title available?)
- Learning noisy linear classifiers via adaptive and selective sampling
- Learning Theory
- scientific article; zbMATH DE number 7255125 (Why is no real title available?)
- Convergence of sparse variational inference in Gaussian processes regression
- Community detection and percolation of information in a geometric setting
- Learning low-dimensional nonlinear structures from high-dimensional noisy data: an integral operator approach
- Estimation of the mean function of functional data via deep neural networks
- Error bounds and the asymptotic setting in kernel-based approximation
- Statistical Inference on Panel Data Models: A Kernel Ridge Regression Method
- Minimax nonparametric multi-sample test under smoothing
- An asymptotic study of the joint maximum likelihood estimation of the regularity and the amplitude parameters of a periodized Matérn model
- Accuracy of suboptimal solutions to kernel principal component analysis
- Explicit embeddings for nearest neighbor search with Mercer kernels
This page was built for publication: Accurate error bounds for the eigenvalues of the kernel matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174041)
