Sciweavers

22 search results - page 2 / 5
» Worst-Case Absolute Loss Bounds for Linear Learning Algorith...
Sort
View
COLT
2010
Springer
13 years 3 months ago
Learning Rotations with Little Regret
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...
Elad Hazan, Satyen Kale, Manfred K. Warmuth
ALT
2004
Springer
14 years 2 months ago
Relative Loss Bounds and Polynomial-Time Predictions for the k-lms-net Algorithm
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
Mark Herbster
AIA
2007
13 years 6 months ago
Improving the aggregating algorithm for regression
Kernel Ridge Regression (KRR) and the recently developed Kernel Aggregating Algorithm for Regression (KAAR) are regression methods based on Least Squares. KAAR has theoretical adv...
Steven Busuttil, Yuri Kalnishkan, Alexander Gammer...
COLT
2006
Springer
13 years 9 months ago
Online Multitask Learning
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 ...
Ofer Dekel, Philip M. Long, Yoram Singer
COLT
2006
Springer
13 years 9 months ago
Online Tracking of Linear Subspaces
We address the problem of online de-noising a stream of input points. We assume that the clean data is embedded in a linear subspace. We present two online algorithms for tracking ...
Koby Crammer