General Algorithmic Frameworks for Online Problem.
We study general algorithmic frameworks for online learning tasks. These include binary classification, regression, multiclass problems and cost-sensitive multiclass classification. The theorems that we present give loss bounds on the behavior of our algorithms which depend on general conditions on the iterative step sizes.
Censor
Yair
Y
Department of Mathematics, University of Haifa Mt. Carmel, 31905 Haifa, Israel ( yair@math.haifa.ac.il ).
Reich
Simeon
S
Zaslavski
Alexander J
AJ