68 search results - page 10 / 14 » Online Multiple Kernel Learning: Algorithms and Mistake Boun... |
106
click to vote
COLT
2010
Springer
14 years 7 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...
EUROCOLT
1995
Springer
15 years 1 months ago
1995
Springer
k. The model we study can be interpreted as a broad, abstract extension of the well-studied on-line prediction model to a general decision-theoretic setting. We show that the multi...
COLT
2006
Springer
15 years 1 months ago
2006
Springer
We study the problem of online learning of multiple tasks in parallel. On each online round, the algorithm receives an instance and makes a prediction for each one of the parallel ...
COLT
1992
Springer
15 years 1 months ago
1992
Springer
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
DCC
2009
IEEE
15 years 10 months ago
2009
IEEE
Kernel machines are a popular class of machine learning algorithms that achieve state of the art accuracies on many real-life classification problems. Kernel perceptrons are among...