3 papers
cs.LG2018
Revisiting Projection-Free Optimization for Strongly Convex Constraint Sets
Jarrid Rector-Brooks, Jun-Kun Wang, Barzan Mozafari
We revisit the Frank-Wolfe (FW) optimization under strongly convex constraint sets. We provide a faster convergence rate for FW without line search, showing that a previously overl…
cs.LG2018
Acceleration through Optimistic No-Regret Dynamics
Jun-Kun Wang, Jacob Abernethy
We consider the problem of minimizing a smooth convex function by reducing the optimization to computing the Nash equilibrium of a particular zero-sum convex-concave game. Zero-sum…
cs.LG2018
Faster Rates for Convex-Concave Games
Jacob Abernethy, Kevin A. Lai, Kfir Y. Levy +1
We consider the use of no-regret algorithms to compute equilibria for particular classes of convex-concave games. While standard regret bounds would lead to convergence rates on th…