Improved Regret Bounds for Projection-free Bandit Convex Optimization. - Dan Garber; Ben Kretzu (AISTATS, 2020)

Revisiting Projection-free Online Learning: the Strongly Convex Case. - Ben Kretzu; Dan Garber (AISTATS, 2021)

New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees. - Dan Garber; Ben Kretzu (COLT, 2022)

Projection-free Online Exp-concave Optimization. - Dan Garber; Ben Kretzu (COLT, 2023)

Projection-Free Online Convex Optimization with Time-Varying Constraints. - Dan Garber; Ben Kretzu (ICML, 2024)