7 citations · 7 across the 1 of their papers we have counts for
2 papers
cs.LG2020
Revisiting Projection-free Online Learning: the Strongly Convex Case
Dan Garber, Ben Kretzu
Projection-free optimization algorithms, which are mostly based on the classical Frank-Wolfe method, have gained significant interest in the machine learning community in recent ye…
cs.LG2019★ 7 cited
Improved Regret Bounds for Projection-free Bandit Convex Optimization
Dan Garber, Ben Kretzu
We revisit the challenge of designing online algorithms for the bandit convex optimization problem (BCO) which are also scalable to high dimensional problems. Hence, we consider al…