We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universal online bounds as an optimization problem. Using the weak duality theorem we reduce the process of online learning to the task of incrementally increasing the dual objective function. The amount by which the dual increases serves as a new and natural notion of progress. We are thus able to tie the primal objective value and the number of prediction mistakes using and the increase in the dual. The end result is a general framework for designing and analyzing old and new online learning algorithms in the mistake bound model. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Shalev-Shwartz, S., & Singer, Y. (2006). Online learning meets optimization in the dual. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4005 LNAI, pp. 423–437). Springer Verlag. https://doi.org/10.1007/11776420_32
Mendeley helps you to discover research relevant for your work.