686 search results - page 7 / 138 » Minimax Probability Machine |
COLT
2010
Springer
13 years 8 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
COLT
2003
Springer
14 years 3 months ago
2003
Springer
MLDM
2007
Springer
14 years 4 months ago
2007
Springer
TNN
2008
13 years 10 months ago
2008
Abstract--Tao et al. have recently proposed the posterior probability support vector machine (PPSVM) which uses soft labels derived from estimated posterior probabilities to be mor...
ML
2002
ACM
13 years 9 months ago
2002
ACM
I describe a framework for interpreting Support Vector Machines (SVMs) as maximum a posteriori (MAP) solutions to inference problems with Gaussian Process priors. This probabilisti...