Sciweavers

54 search results - page 9 / 11
» On the efficient minimization of convex surrogates in superv...
Sort
View
ICDM
2009
IEEE
92views Data Mining» more  ICDM 2009»
14 years 7 months ago
Semi-supervised Multi-task Learning with Task Regularizations
Multi-task learning refers to the learning problem of performing inference by jointly considering multiple related tasks. There have already been many research efforts on supervise...
Fei Wang, Xin Wang, Tao Li
JMLR
2010
147views more  JMLR 2010»
14 years 4 months ago
Spectral Regularization Algorithms for Learning Large Incomplete Matrices
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
Rahul Mazumder, Trevor Hastie, Robert Tibshirani
IJCAI
2003
14 years 11 months ago
When Discriminative Learning of Bayesian Network Parameters Is Easy
Bayesian network models are widely used for discriminative prediction tasks such as classification. Usually their parameters are determined using 'unsupervised' methods ...
Hannes Wettig, Peter Grünwald, Teemu Roos, Pe...
ICML
2006
IEEE
15 years 10 months ago
Deterministic annealing for semi-supervised kernel machines
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chape...
JMLR
2010
187views more  JMLR 2010»
14 years 4 months ago
SFO: A Toolbox for Submodular Function Optimization
In recent years, a fundamental problem structure has emerged as very useful in a variety of machine learning applications: Submodularity is an intuitive diminishing returns proper...
Andreas Krause