Online Learning and Online Convex Optimization
Foundations and Trends® in Machine Learning · 29.03.2012 · 4 (2) · 107-194
DOI: 10.1561/2200000018 ↗Kurz gefasst
Fachartikel in der Zeitschrift Foundations and Trends® in Machine Learning, online erschienen am 29.03.2012. Verfasst von Shai Shalev-Shwartz. Die Arbeit wurde bisher 1098-mal zitiert (Crossref) und nennt 46 Literaturangaben.
Abstract (Originalsprache)
Online learning is a well established learning paradigm which has both theoretical and practical appeals. The goal of online learning is to make a sequence of accurate predictions given knowledge of the correct answer to previous prediction tasks and possibly additional available information. Online learning has been studied in several research fields including game theory, information theory, and machine learning. It also became of great interest to practitioners due the recent emergence of large scale applications such as online advertisement placement and online web ranking. In this survey we provide a modern overview of online learning. Our goal is to give the reader a sense of some of the interesting ideas and in particular to underscore the centrality of convexity in deriving efficient online learning algorithms. We do not mean to be comprehensive but rather to give a high-level, rigorous yet easy to follow, survey.
Zitieren
APA
Shalev-Shwartz, S. (2012). Online Learning and Online Convex Optimization. Foundations and Trends® in Machine Learning, 4(2), 107-194. https://doi.org/10.1561/2200000018
Vancouver
Shalev-Shwartz S. Online Learning and Online Convex Optimization. Foundations and Trends® in Machine Learning. 2012;4(2):107-194. doi:10.1561/2200000018
BibTeX
@article{ShalevShwartz2012,
author = {Shalev-Shwartz, Shai},
title = {Online Learning and Online Convex Optimization},
journal = {Foundations and Trends® in Machine Learning},
year = {2012},
volume = {4},
number = {2},
pages = {107--194},
doi = {10.1561/2200000018}
}
EUVIMED