2 papers
math.OC2026
First-Order Sparse Convex Optimization: Better Rates with Sparse Updates
Dan Garber
It was recently established that for convex optimization problems with sparse optimal solutions (be it entry-wise sparsity or matrix rank-wise sparsity) it is possible to design fi…
math.OC2025
Blackwell's Approachability with Approximation Algorithms
Dan Garber, Mhna Massalha
We revisit Blackwell's celebrated approachability problem which considers a repeated vector-valued game between a player and an adversary. Motivated by settings in which the action…