Sciweavers

18 search results - page 2 / 4
» Consistency of Multiclass Empirical Risk Minimization Method...
Sort
View
JMLR
2006
143views more  JMLR 2006»
13 years 6 months ago
Consistency and Convergence Rates of One-Class SVMs and Related Algorithms
We determine the asymptotic behaviour of the function computed by support vector machines (SVM) and related algorithms that minimize a regularized empirical convex loss function i...
Régis Vert, Jean-Philippe Vert
JMLR
2010
143views more  JMLR 2010»
13 years 4 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
COLT
2005
Springer
13 years 11 months ago
Ranking and Scoring Using Empirical Risk Minimization
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...
Stéphan Clémençon, Gáb...
SIGIR
2002
ACM
13 years 5 months ago
Risk minimization and language modeling in text retrieval dissertation abstract
tion Abstract ChengXiang Zhai (Advisor: John Lafferty) Language Technologies Institute School of Computer Science Carnegie Mellon University With the dramatic increase in online in...
ChengXiang Zhai
PAMI
2011
13 years 1 months ago
Cost-Sensitive Boosting
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
Hamed Masnadi-Shirazi, Nuno Vasconcelos