Revisiting Projection-free Online Learning: the Strongly Convex Case

v1v2 (latest)

Revisiting Projection-free Online Learning: the Strongly Convex Case

15 October 2020

ArXiv (abs)PDF HTML

Papers citing "Revisiting Projection-free Online Learning: the Strongly Convex Case"

8 / 8 papers shown

Title
Order-Optimal Projection-Free Algorithm for Adversarially Constrained Online Convex Optimization Yiyang Lu M. Pedramfar Vaneet Aggarwal 3DV 84 2 0 23 Feb 2025
Safe Online Convex Optimization with Multi-Point Feedback Spencer Hutchinson Mahnoosh Alizadeh 48 1 0 16 Jul 2024
Improved Dynamic Regret for Online Frank-Wolfe Yuanyu Wan Lijun Zhang Mingli Song 89 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 140 13 0 02 Jan 2023
Projection-free Adaptive Regret with Membership Oracles Zhou Lu Nataly Brukhim Paula Gradu Elad Hazan 99 16 0 22 Nov 2022
Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning Zakaria Mhammedi 95 9 0 23 May 2022
New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees Dan Garber Ben Kretzu 99 21 0 09 Feb 2022
Projection-free Online Learning over Strongly Convex Sets Yuanyu Wan Lijun Zhang 119 28 0 16 Oct 2020