Ideal regularization for learning kernels from labels

doi:10.1016/j.neunet.2014.04.003

Return

Ideal regularization for learning kernels from labels

2014-08-01

PRE

潘彬彬 (Binbin Pan)

Jianhuang Lai *

Lixin Shen

DOI：10.1016/j.neunet.2014.04.003

Original

Original request for help

Save

Abstract

En 中文

In this paper, we propose a new form of regularization that is able to utilize the label information of a data set for learning kernels. The proposed regularization, referred to as ideal regularization, is a linear function of the kernel matrix to be learned. The ideal regularization allows us to develop efficient algorithms to exploit labels. Three applications of the ideal regularization are considered. Firstly, we use the ideal regularization to incorporate the labels into a standard kernel, making the resulting kernel more appropriate for learning tasks. Next, we employ the ideal regularization to learn a data-dependent kernel matrix from an initial kernel matrix (which contains prior similarity information, geometric structures, and labels of the data). Finally, we incorporate the ideal regularization to some state-of-the-art kernel learning problems. With this regularization, these learning problems can be formulated as simpler ones which permit more efficient solvers. Empirical results show that the ideal regularization exploits the labels effectively and efficiently. (C) 2014 Elsevier Ltd. All rights reserved.

Keywords:

Kernel methods

Regularization

Labels

Ideal kernel

Semi-supervised learning

von Neumann divergence

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.