Online Learning and Online Convex Optimization

被引:1150
|
作者
Shalev-Shwartz, Shai [1 ]
机构
[1] Hebrew Univ Jerusalem, Benin Sch Comp Sci & Engn, Jerusalem, Israel
来源
关键词
D O I
10.1561/2200000018
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:107 / 194
页数:88
相关论文
共 50 条
  • [1] Online Shortest Path Learning via Convex Optimization
    Vural, N. Mert
    Altas, Burak
    Ilhan, Fatih
    Kozat, Suleyman S.
    [J]. 2020 28TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2020,
  • [2] Predictive online convex optimization
    Lesage-Landry, Antoine
    Shames, Iman
    Taylor, Joshua A.
    [J]. AUTOMATICA, 2020, 113
  • [3] Boosting for Online Convex Optimization
    Hazan, Elad
    Singh, Karan
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 139, 2021, 139
  • [4] Conservative Online Convex Optimization
    de Luca, Martino Bernasconi
    Vittori, Edoardo
    Trovo, Francesco
    Restelli, Marcello
    [J]. MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, 2021, 12975 : 19 - 34
  • [5] Online Submodular Maximization via Online Convex Optimization
    Salem, Tareq Si
    Ozcan, Gozde
    Nikolaou, Iasonas
    Terzi, Evimaria
    Ioannidis, Stratis
    [J]. THIRTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 38 NO 13, 2024, : 15038 - 15046
  • [6] Distributed adaptive online learning for convex optimization with weight decay
    Shen, Xiuyu
    Li, Dequan
    Fang, Runyue
    Zhou, Yuejin
    Wu, Xiongjun
    [J]. ASIAN JOURNAL OF CONTROL, 2022, 24 (02) : 562 - 575
  • [7] Robust Learning for Smoothed Online Convex Optimization with Feedback Delay
    Li, Pengfei
    Yang, Jianyi
    Wierman, Adam
    Ren, Shaolei
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [8] Learning the Optimal Energy Supply Plan with Online Convex Optimization
    Chadoulos, Spiros
    Koutsopoulos, Iordanis
    [J]. IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2021), 2021,
  • [9] The Online Saddle Point Problem and Online Convex Optimization with Knapsacks
    Cardoso, Adrian Rivera
    Wang, He
    Xu, Huan
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2024,
  • [10] Online Convex Optimization With Binary Constraints
    Lesage-Landry, Antoine
    Taylor, Joshua A.
    Callaway, Duncan S.
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2021, 66 (12) : 6164 - 6170