22 citations · 30 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
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…
math.OC2019
On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems
Dan Garber
Smooth convex minimization over the unit trace-norm ball is an important optimization problem in machine learning, signal processing, statistics and other fields, that underlies ma…