Accuracy of suboptimal solutions to kernel principal component analysis
From MaRDI portal
Recommendations
- Error bounds for suboptimal solutions to kernel principal component analysis
- Approximate kernel PCA: computational versus statistical trade-off
- Accurate error bounds for the eigenvalues of the kernel matrix
- Kernel Principal Component Analysis: Applications, Implementation and Comparison
- On the predictive potential of kernel principal components
- Robust kernel principal component analysis with optimal mean
- Approximate kernel partial least squares
- Revisiting the predictive power of kernel principal components
- PCA-kernel estimation
Cites work
- scientific article; zbMATH DE number 3888314 (Why is no real title available?)
- scientific article; zbMATH DE number 3933858 (Why is no real title available?)
- scientific article; zbMATH DE number 3936168 (Why is no real title available?)
- scientific article; zbMATH DE number 4004880 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 236854 (Why is no real title available?)
- scientific article; zbMATH DE number 3209538 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- scientific article; zbMATH DE number 3337815 (Why is no real title available?)
- scientific article; zbMATH DE number 3399886 (Why is no real title available?)
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- An Approach to Time Series Analysis
- An introduction to support vector machines and other kernel-based learning methods.
- Bounds on rates of variable-basis and neural-network approximation
- Comparison of worst case errors in linear and neural network approximation
- Error Estimates for Approximate Optimization by the Extended Ritz Method
- Learning with generalization capability by kernel methods of bounded complexity
- On the Eigenspectrum of the Gram Matrix and the Generalization Error of Kernel-PCA
- On the Nyström method for approximating a gram matrix for improved kernel-based learning
- On the mathematical foundations of learning
- Regularization algorithms for learning that are equivalent to multilayer networks
- Relationship of several variational methods for the approximate solution of ill-posed problems
- Support-vector networks
- Theory of Reproducing Kernels
- Universal approximation bounds for superpositions of a sigmoidal function
Cited in
(12)- Approximate kernel PCA: computational versus statistical trade-off
- A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization
- On spectral windows in supervised learning from data
- New insights into Witsenhausen's counterexample
- Can dictionary-based computational models outperform the best linear ones?
- Convex combination of data matrices: PCA perturbation bounds for multi-objective optimal design of mechanical metafilters
- Unsupervised learning of disentangled representations in deep restricted kernel machines with orthogonality constraints
- Error bounds for suboptimal solutions to kernel principal component analysis
- Functional optimization by variable-basis approximation schemes
- Team optimization problems with Lipschitz continuous strategies
- The weight-decay technique in learning from data: an optimization point of view
- Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling
This page was built for publication: Accuracy of 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 Q842769)
