Error bounds for suboptimal solutions to kernel principal component analysis
From MaRDI portal
(Redirected from Publication:968012)
Recommendations
Cites work
- scientific article; zbMATH DE number 5277890 (Why is no real title available?)
- scientific article; zbMATH DE number 3936168 (Why is no real title available?)
- scientific article; zbMATH DE number 3464396 (Why is no real title available?)
- scientific article; zbMATH DE number 976323 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- Accuracy of suboptimal solutions to kernel principal component analysis
- Algorithms with high order convergence speed for blind source extraction
- Comparison of worst case errors in linear and neural network approximation
- Error Estimates for Approximate Optimization by the Extended Ritz Method
- Random matrix approximation of spectra of integral operators
- The Hoffman-Wielandt inequality in infinite dimensions
- Theory of Reproducing Kernels
- Universal approximation bounds for superpositions of a sigmoidal function
Cited in
(5)- Accuracy of suboptimal solutions to kernel principal component analysis
- On spectral windows in supervised learning from data
- Unsupervised learning of disentangled representations in deep restricted kernel machines with orthogonality constraints
- Robust kernel principal component analysis with optimal mean
- Functional optimization by variable-basis approximation schemes
This page was built for publication: Error bounds for suboptimal solutions to kernel principal component analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968012)