1955 search results - page 122 / 391 » Online Multitask Learning |
128
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
126
click to vote
COLT
1991
Springer
15 years 6 months ago
1991
Springer
While most theoretical work in machine learning has focused on the complexity of learning, recently there has been increasing interest in formally studying the complexity of teach...
136
click to vote
SOFSEM
2010
Springer
16 years 1 days ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
125
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
160
click to vote
COLT
2010
Springer
15 years 1 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...