Feature space perspectives for learning the kernel

DOI10.1007/s10994-006-0679-0zbMath1470.68148OpenAlexW2109033859MaRDI QIDQ2384133

Charles A. Micchelli, Massimiliano Pontil

Publication date: 20 September 2007

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

Full work available at URL: https://doi.org/10.1007/s10994-006-0679-0

zbMATH Keywords

convex optimizationkernel methodssparsityBanach space regularizationlearning the kernels

Mathematics Subject Classification ID

Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (6)

Regularizing multiple kernel learning using response surface methodology ⋮ On reproducing kernel Banach spaces: generic definitions and unified framework of constructions ⋮ Learning with optimal interpolation norms ⋮ Regularizers for structured sparsity ⋮ Learning sparse gradients for variable selection and dimension reduction ⋮ Regularized learning in Banach spaces as an optimization problem: representer theorems

Uses Software

• PDCO

Cites Work

• Multi-kernel regularized classifiers
• Convex analysis and nonlinear optimization. Theory and examples
• A feature selection Newton method for support vector machine classification
• Error bounds for learning the kernel
• Curves from variational principles
• Atomic Decomposition by Basis Pursuit
• Learning Theory
• Algorithmic Learning Theory
• Learning Theory
• On Learning Vector-Valued Functions
• Theory of Reproducing Kernels
• Structural modelling with sparse kernels
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Feature space perspectives for learning the kernel