A new scheme to learn a kernel in regularization networks

Authors:
Jie Chen;Fei Ma;Jian Chen
Affiliations:
Department of Mathematics, Yibin University, Yibin 644000, PR China;Xinhu Futures Co. Ltd., 36F, InterContinental Bussiness Center, No.100 Yutong Rd, Shanghai 200070, PR China;Department of Mathematics, Foshan University, Foshan 528000, PR China
Venue:
Neurocomputing
Year:
2011

Citing 12
Cited 0

Semidefinite programming

SIAM Review
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond

Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Constructing Descriptive and Discriminative Nonlinear Features: Rayleigh Coefficients in Kernel Feature Spaces

IEEE Transactions on Pattern Analysis and Machine Intelligence
Convex Optimization

Convex Optimization
Learning the Kernel Matrix with Semidefinite Programming

The Journal of Machine Learning Research
Learning a kernel matrix for nonlinear dimensionality reduction

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Learning the Kernel Function via Regularization

The Journal of Machine Learning Research
Optimal kernel selection in Kernel Fisher discriminant analysis

ICML '06 Proceedings of the 23rd international conference on Machine learning
Learning Theory: An Approximation Theory Viewpoint (Cambridge Monographs on Applied & Computational Mathematics)

Learning Theory: An Approximation Theory Viewpoint (Cambridge Monographs on Applied & Computational Mathematics)
Universal Kernels

The Journal of Machine Learning Research
Rademacher chaos complexities for learning the kernel problem

Neural Computation
Learning convex combinations of continuously parameterized basic kernels

COLT'05 Proceedings of the 18th annual conference on Learning Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we propose a new scheme to learn a kernel function from the convex combination of finite given kernels in regularization networks. We show that the corresponding variational problem is convex and under certain conditions, the variational problem can be approximated by a semidefinite programming problem which coincides with the Micchelli and Pontil's (MP's) Model (Micchelli and Pontil, 2005 [10]).