Learning Bounds for Support Vector Machines with Learned Kernels

DOI10.1007/11776420_15zbMath1143.68561OpenAlexW1559159361MaRDI QIDQ5307567

Nathan Srebro, Shai Ben-David

Publication date: 14 September 2007

Published in: Learning Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11776420_15

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Fast learning rate of non-sparse multiple kernel learning and optimal regularization strategies, Multiple Kernel Learningの学習理論, Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness, Sparsity in multiple kernel learning, Composite kernel learning, Multiple Spectral Kernel Learning and a Gaussian Complexity Computation, Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem, Learning rates of multi-kernel regularized regression, Rademacher Chaos Complexities for Learning the Kernel Problem, A PAC Approach to Application-Specific Algorithm Selection, Multi-task and Lifelong Learning of Kernels, Unnamed Item