Universal Online Convex Optimization with $1$ Projection per Round

30 May 2024

Papers citing "Universal Online Convex Optimization with $1$ Projection per Round"

10 / 10 papers shown

Title
Efficient Methods for Non-stationary Online Learning Peng Zhao Yan-Feng Xie Lijun Zhang Zhi Zhou 78 22 0 16 Sep 2023
Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach Yu-Hu Yan Peng Zhao Zhiguang Zhou 49 9 0 17 Jul 2023
Parameter-free Mirror Descent Andrew Jacobsen Ashok Cutkosky 57 34 0 26 Feb 2022
Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits Haipeng Luo Mengxiao Zhang Peng Zhao Zhi Zhou 66 17 0 12 Feb 2022
Projection-free Online Learning over Strongly Convex Sets Yuanyu Wan Lijun Zhang 101 28 0 16 Oct 2020
Faster Projection-free Online Learning Elad Hazan Edgar Minasyan 66 59 0 30 Jan 2020
Introduction to Online Convex Optimization Elad Hazan OffRL 154 1,927 0 07 Sep 2019
Adaptivity and Optimality: A Universal Algorithm for Online Convex Optimization Guanghui Wang Shiyin Lu Lijun Zhang ODL 39 23 0 15 May 2019
Adaptive Regret of Convex and Smooth Functions Lijun Zhang Tie-Yan Liu Zhi Zhou ODL 55 45 0 26 Apr 2019
Strongly Adaptive Online Learning Amit Daniely Alon Gonen Shai Shalev-Shwartz ODL 160 178 0 25 Feb 2015