68 search results - page 5 / 14 » Online Multiple Kernel Learning: Algorithms and Mistake Boun... |
JMLR
2012
11 years 10 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
FOCM
2006
13 years 7 months ago
2006
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHS) and general Hilbert spaces. We present a general form of the stochastic gradient m...
ILP
2005
Springer
14 years 1 months ago
2005
Springer
Online learning algorithms such as Winnow have received much attention in Machine Learning. Their performance degrades only logarithmically with the input dimension, making them us...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Online multiplicative weight-update learning algorithms, such as Winnow, have proven to behave remarkably for learning simple disjunctions with few relevant attributes. The aim of ...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We propose a model-based learning algorithm, the Adaptive Aggregation Algorithm (AAA), that aims to solve the online, continuous state space reinforcement learning problem in a de...