Understand Dynamic Regret with Switching Cost for Online Decision Making

28 November 2019

Papers citing "Understand Dynamic Regret with Switching Cost for Online Decision Making"

7 / 7 papers shown

Title
Markov Chain Mirror Descent On Data Federation Yawei Zhao FedML 77 1 0 26 Sep 2023
Online Submodular Maximization via Online Convex Optimization T. Si Salem Gözde Özcan Iasonas Nikolaou Evimaria Terzi Stratis Ioannidis 82 5 0 08 Sep 2023
Efficient Online Learning with Memory via Frank-Wolfe Optimization: Algorithms with Bounded Dynamic Regret and Applications to Control Hongyu Zhou Zirui Xu Vasileios Tzoumas 142 13 0 02 Jan 2023
Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor Lijun Zhang Wei Jiang Jinfeng Yi Tianbao Yang 92 7 0 02 May 2022
Revisiting Smoothed Online Learning Lijun Zhang Wei Jiang Shiyin Lu Tianbao Yang 104 28 0 13 Feb 2021
Dynamic Regret of Policy Optimization in Non-stationary Environments Yingjie Fei Zhuoran Yang Zhaoran Wang Qiaomin Xie 93 56 0 30 Jun 2020
Decentralized Online Learning: Take Benefits from Others' Data without Sharing Your Own to Track Global Trend Wendi Wu Zongren Li Yawei Zhao Chenkai Yu P. Zhao Ji Liu FedML 101 17 0 29 Jan 2019