7 citations · 7 across the 2 of their papers we have counts for
2 papers
math.OC2023
Analyzing and Improving Greedy 2-Coordinate Updates for Equality-Constrained Optimization via Steepest Descent in the 1-Norm
Amrutha Varshini Ramesh, Aaron Mishkin, Mark Schmidt +3
We consider minimizing a smooth function subject to a summation constraint over its variables. By exploiting a connection between the greedy 2-coordinate update for this problem an…
cs.LG2020★ 7 cited
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses
Yihan Zhou, Victor S. Portella, Mark Schmidt +1
In online convex optimization (OCO), Lipschitz continuity of the functions is commonly assumed in order to obtain sublinear regret. Moreover, many algorithms have only logarithmic…