Error bounds for learning the kernel
From MaRDI portal
Recommendations
- Error bounds for \(l^p\)-norm multiple kernel learning with least square loss
- Learning with generalization capability by kernel methods of bounded complexity
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- Error analysis on regularized learning
- Generalization bounds of a compressed regression learning algorithm
Cites work
- scientific article; zbMATH DE number 5968915 (Why is no real title available?)
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- 10.1162/153244303321897690
- Algorithmic Learning Theory
- Algorithms for learning kernels based on centered alignment
- Consistency analysis of an empirical minimum error entropy algorithm
- ESTIMATING THE APPROXIMATION ERROR IN LEARNING THEORY
- Error bounds for learning the kernel
- Learnability of Gaussians with flexible variances
- Learning Theory
- Learning Theory
- Learning the kernel function via regularization
- Learning the kernel matrix with semidefinite programming
- Learning theory approach to minimum error entropy criterion
- Learning with sample dependent hypothesis spaces
- Logistic classification with varying gaussians
- Multi-kernel regularized classifiers
- On spectral learning
- Regularization schemes for minimum error entropy principle
- Structured sparsity and generalization
- Support vector machine soft margin classifiers: error analysis
- Weak convergence and empirical processes. With applications to statistics
Cited in
(23)- Reproducing kernels and choices of associated feature spaces, in the form of \(L^2\)-spaces
- Fast learning rate of non-sparse multiple kernel learning and optimal regularization strategies
- Deterministic error bounds for kernel-based learning techniques under bounded noise
- Kernel selection with spectral perturbation stability of kernel matrix
- Learning rates for partially linear support vector machine in high dimensions
- Analysis of regularized least squares ranking with centered reproducing kernel
- Learning and approximation by Gaussians on Riemannian manifolds
- Error bounds for \(l^p\)-norm multiple kernel learning with least square loss
- Bias corrected regularization kernel method in ranking
- scientific article; zbMATH DE number 1843054 (Why is no real title available?)
- Generalization bounds of a compressed regression learning algorithm
- Conditional mean embedding and optimal feature selection via positive definite kernels
- Generalized support vector regression: duality and tensor-kernel representation
- Positive Semi-definite Embedding for Dimensionality Reduction and Out-of-Sample Extensions
- Learning with generalization capability by kernel methods of bounded complexity
- Learning with centered reproducing kernels
- Learning with sample dependent hypothesis spaces
- Optimal regression rates for SVMs using Gaussian kernels
- Feature space perspectives for learning the kernel
- scientific article; zbMATH DE number 6999914 (Why is no real title available?)
- Asymptotic analysis of the learning curve for Gaussian process regression
- Optimality of regularized least squares ranking with imperfect kernels
- Error bounds for learning the kernel
This page was built for publication: Error bounds for learning the kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835989)
