686 search results - page 13 / 138 » Minimax Probability Machine |
85
Voted
COLT
2008
Springer
15 years 2 months ago
2008
Springer
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
LWA
2004
15 years 2 months ago
2004
Support Vector Machines (SVMs) have become a popular learning algorithm, in particular for large, high-dimensional classification problems. SVMs have been shown to give most accur...
94
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
79
Voted
COLT
2004
Springer
15 years 6 months ago
2004
Springer
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
119
Voted
ISIPTA
2005
IEEE
15 years 6 months ago
2005
IEEE
The paper presents an efficient solution to decision problems where direct partial information on the distribution of the states of nature is available, either by observations of ...