1055 search results - page 62 / 211 » Convex Factorization Machines |
130
click to vote
ICML
2006
IEEE
16 years 1 months ago
2006
IEEE
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
97
Voted
ICML
2009
IEEE
15 years 7 months ago
2009
IEEE
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
115
Voted
ECML
2007
Springer
15 years 6 months ago
2007
Springer
L1 regularization is effective for feature selection, but the resulting optimization is challenging due to the non-differentiability of the 1-norm. In this paper we compare state...
99
Voted
ECML
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider a new discriminative learning approach to sequence labeling based on the statistical concept of the Z-score. Given a training set of pairs of hidden-observed ...
96
Voted
COLT
2005
Springer
15 years 6 months ago
2005
Springer
A general model is proposed for studying ranking problems. We investigate learning methods based on empirical minimization of the natural estimates of the ranking risk. The empiric...