Pages that link to "Item:Q5307567"
From MaRDI portal
The following pages link to Learning Bounds for Support Vector Machines with Learned Kernels (Q5307567):
Displaying 14 items.
- Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness (Q366980) (← links)
- Learning with generalization capability by kernel methods of bounded complexity (Q558012) (← links)
- Sparsity in multiple kernel learning (Q620564) (← links)
- A meta-learning method to select the kernel width in support vector regression (Q703049) (← links)
- Learning rates of multi-kernel regularized regression (Q974504) (← links)
- Fast learning rate of non-sparse multiple kernel learning and optimal regularization strategies (Q1657947) (← links)
- Composite kernel learning (Q1959567) (← links)
- Multi-task and Lifelong Learning of Kernels (Q2835628) (← links)
- Rademacher Chaos Complexities for Learning the Kernel Problem (Q3057230) (← links)
- Multiple Kernel Learningの学習理論 (Q5011460) (← links)
- (Q5148999) (← links)
- A PAC Approach to Application-Specific Algorithm Selection (Q5269823) (← links)
- Multiple Spectral Kernel Learning and a Gaussian Complexity Computation (Q5378237) (← links)
- Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem (Q5378343) (← links)
