Projection-free Online Learning over Strongly Convex Sets

16 October 2020

Papers citing "Projection-free Online Learning over Strongly Convex Sets"

6 / 6 papers shown

Title
Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees Yibo Wang Wenhao Yang Wei Jiang Shiyin Lu Bing Wang Haihong Tang Yuanyu Wan Lijun Zhang 26 6 0 19 May 2023
Improved Dynamic Regret for Online Frank-Wolfe Yuanyu Wan Lijun Zhang Mingli Song 15 11 0 11 Feb 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 71 13 0 02 Jan 2023
Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning Zakaria Mhammedi 17 8 0 23 May 2022
New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees Dan Garber Ben Kretzu 27 21 0 09 Feb 2022
A Linearly Convergent Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization Dan Garber Elad Hazan 61 94 0 20 Jan 2013