3643 search results - page 371 / 729 » Learning Submodular Functions |
172
Voted
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the margin-based bounds due to Bartlett et al. (2006). The...
179
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...
193
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper, we propose two new support vector approaches for ordinal regression, which optimize multiple thresholds to define parallel discriminant hyperplanes for the ordinal ...
148
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
184
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...