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