159 search results - page 4 / 32 » Margin Maximizing Loss Functions |
JMLR
2012
12 years 1 months ago
2012
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
ICPR
2008
IEEE
15 years 2 days ago
2008
IEEE
The classification performance of nearest prototype classifiers largely relies on the prototype learning algorithms, such as the learning vector quantization (LVQ) and the minimum...
COLT
2008
Springer
14 years 20 days ago
2008
Springer
Boosting algorithms build highly accurate prediction mechanisms from a collection of lowaccuracy predictors. To do so, they employ the notion of weak-learnability. The starting po...
JMLR
2010
13 years 5 months ago
2010
We study losses for binary classification and class probability estimation and extend the understanding of them from margin losses to general composite losses which are the compos...
COLT
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...