42 search results - page 4 / 9 » A Quasi-Newton Approach to Nonsmooth Convex Optimization Pro... |
COLT
2006
Springer
13 years 10 months ago
2006
Springer
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
ACML
2009
Springer
13 years 11 months ago
2009
Springer
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
ICML
2006
IEEE
14 years 7 months ago
2006
IEEE
We present a new, statistical approach to rule learning. Doing so, we address two of the problems inherent in traditional rule learning: The computational hardness of finding rule...
ICML
2009
IEEE
14 years 7 months ago
2009
IEEE
We present a large-margin formulation and algorithm for structured output prediction that allows the use of latent variables. Our proposal covers a large range of application prob...
ECML
2007
Springer
14 years 1 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 ...