54 search results - page 5 / 11 » On the efficient minimization of convex surrogates in superv... |
126
click to vote
SAGA
2009
Springer
15 years 4 months ago
2009
Springer
We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible dec...
110
click to vote
NIPS
2007
14 years 11 months ago
2007
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
112
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
In many image and video collections, we have access
only to partially labeled data. For example, personal photo
collections often contain several faces per image and a caption
t...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
142
click to vote
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
An approach to semi-supervised learning is proposed that is based on a Gaussian random field model. Labeled and unlabeled data are represented as vertices in a weighted graph, wit...