Dan Garber
28 papers · 2011–2025 · 6 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 17 separate collaboration groups - the largest holds only 18% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Dan Garber?
4 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
13 papers whose co-authors appear nowhere else under this name
Blackwell’s Approachability with Approximation Algorithms
COLT 2025
Faster Projection-Free Augmented Lagrangian Methods via Weak Proximal Oracle
AISTATS 2023
Frank-Wolfe-based Algorithms for Approximating Tyler's M-estimator
NeurIPS 2022
Local Linear Convergence of Gradient Methods for Subspace Optimization via Strict Complementarity
NeurIPS 2022
Frank-Wolfe with a Nearest Extreme Point Oracle
COLT 2021
On the Convergence of Stochastic Gradient Descent with Low-Rank Projections for Convex Low-Rank Matrix Problems
COLT 2020
Online Convex Optimization in the Random Order Model
ICML 2020
Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and Sparsity
NeurIPS 2020
Logarithmic Regret for Online Gradient Descent Beyond Strong Convexity
AISTATS 2019
On the Regret Minimization of Nonconvex Online Gradient Ascent for Online PCA
COLT 2019
Efficient Online Linear Optimization with Approximation Algorithms
NeurIPS 2017
Faster Projection-free Convex Optimization over the Spectrahedron
NeurIPS 2016
Linear-Memory and Decomposition-Invariant Linearly Convergent Conditional Gradient Algorithm for Structured Polytopes
NeurIPS 2016