Sciweavers

79 search results - page 3 / 16
» Convex multi-task feature learning
Sort
View
AAAI
2011
13 years 9 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
64
Voted
ML
2008
ACM
100views Machine Learning» more  ML 2008»
14 years 9 months ago
Convex multi-task feature learning
Andreas Argyriou, Theodoros Evgeniou, Massimiliano...
KDD
2012
ACM
207views Data Mining» more  KDD 2012»
13 years 1 hour ago
Robust multi-task feature learning
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
Pinghua Gong, Jieping Ye, Changshui Zhang
ML
2007
ACM
14 years 9 months ago
Feature space perspectives for learning the kernel
In this paper, we continue our study of learning an optimal kernel in a prescribed convex set of kernels, [18]. We present a reformulation of this problem within a feature space e...
Charles A. Micchelli, Massimiliano Pontil
CVPR
2010
IEEE
14 years 9 months ago
Learning kernels for variants of normalized cuts: Convex relaxations and applications
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
Lopamudra Mukherjee, Vikas Singh, Jiming Peng, Chr...