Online Passive-Aggressive Algorithms

We present a unified view for online classification, regression, and uni- class problems. This view leads to a single algorithmic framework for the three problems. We prove worst case loss bounds for various algorithms for both the realizable case and the non-realizable case. A conversion of our main online algorithm to the setting of batch learning is also dis- cussed. The end result is new algorithms and accompanying loss bounds for the hinge-loss.

Authors

• Shai Shalev-Shwartz The Hebrew University
• Koby Crammer
• Ofer Dekel
• Yoram Singer

Keywords

No keywords are indexed for this paper.