Accurate error bounds for the eigenvalues of the kernel matrix
From MaRDI portal
Publication:3174041
zbMATH Open1222.62064MaRDI QIDQ3174041FDOQ3174041
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v7/braun06a.html
Recommendations
Factor analysis and principal components; correspondence analysis (62H25) Eigenvalues, singular values, and eigenvectors (15A18) Artificial intelligence (68T99)
Cited In (19)
- 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
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Discovering model structure for partially linear models
- Title not available (Why is that?)
- 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)