68 search results - page 4 / 14 » Online Multiple Kernel Learning: Algorithms and Mistake Boun... |
JMLR
2002
13 years 7 months ago
2002
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We present a discriminative online algorithm with a bounded memory growth, which is based on the kernel-based Perceptron. Generally, the required memory of the kernelbased Percept...
SIGIR
2002
ACM
13 years 7 months ago
2002
ACM
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
NIPS
2001
13 years 9 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...