1 citations · 1 across the 4 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2024
Projection-Free Online Convex Optimization with Time-Varying Constraints
Dan Garber, Ben Kretzu
We consider the setting of online convex optimization with adversarial time-varying constraints in which actions must be feasible w.r.t. a fixed constraint set, and are also requir…
cs.LG2023★ 1 cited
Projection-free Online Exp-concave Optimization
Dan Garber, Ben Kretzu
We consider the setting of online convex optimization (OCO) with \textit{exp-concave} losses. The best regret bound known for this setting is , where is the dimens…