Learning Bounds for Support Vector Machines with Learned Kernels
From MaRDI portal
Recommendations
Cited in
(21)- Fast learning rate of non-sparse multiple kernel learning and optimal regularization strategies
- Composite kernel learning
- Multi-task and lifelong learning of kernels
- Large-margin classification in infinite neural networks
- Rademacher Chaos Complexities for Learning the Kernel Problem
- Maximum margin algorithms with Boolean kernels
- Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness
- scientific article; zbMATH DE number 2080458 (Why is no real title available?)
- Multiple Kernel Learningの学習理論
- Learning data-adaptive non-parametric kernels
- A PAC Approach to Application-Specific Algorithm Selection
- Maximum margin algorithms with Boolean kernels.
- Multiple spectral kernel learning and a Gaussian complexity computation
- Refined Rademacher chaos complexity bounds with applications to the multikernel learning problem
- How Good Is a Kernel When Used as a Similarity Measure?
- Learning Theory
- Learning with generalization capability by kernel methods of bounded complexity
- Sparsity in multiple kernel learning
- On the expressive power of kernel methods and the efficiency of kernel learning by association schemes
- A meta-learning method to select the kernel width in support vector regression
- Learning rates of multi-kernel regularized regression
This page was built for publication: Learning Bounds for Support Vector Machines with Learned Kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5307567)
