Follow
Dan Garber
Dan Garber
Verified email at technion.ac.il - Homepage
Title
Cited by
Cited by
Year
Faster rates for the frank-wolfe method over strongly-convex sets
D Garber, E Hazan
International Conference on Machine Learning, 541-549, 2015
1682015
A linearly convergent variant of the conditional gradient algorithm under strong convexity, with applications to online and stochastic optimization
D Garber, E Hazan
SIAM Journal on Optimization 26 (3), 1493-1528, 2016
1352016
Faster eigenvector computation via shift-and-invert preconditioning
D Garber, E Hazan, C Jin, C Musco, P Netrapalli, A Sidford
International Conference on Machine Learning, 2626-2634, 2016
89*2016
Fast and simple PCA via convex optimization
D Garber, E Hazan
arXiv preprint arXiv:1509.05647, 2015
892015
Online principal components analysis
C Boutsidis, D Garber, Z Karnin, E Liberty
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
742014
Linear-memory and decomposition-invariant linearly convergent conditional gradient algorithm for structured polytopes
D Garber, O Meshi
Advances in neural information processing systems 29, 2016
452016
Online learning of eigenvectors
D Garber, E Hazan, T Ma
International Conference on Machine Learning, 560-568, 2015
442015
Approximating semidefinite programs in sublinear time
D Garber, E Hazan
Advances in Neural Information Processing Systems 24, 2011
432011
Playing non-linear games with linear oracles
D Garber, E Hazan
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 420-428, 2013
412013
Efficient globally convergent stochastic optimization for canonical correlation analysis
W Wang, J Wang, D Garber, N Srebro
Advances in Neural Information Processing Systems 29, 2016
352016
Faster Projection-free Convex Optimization over the Spectrahedron
D Garber
arxiv, 2016
332016
Communication-efficient algorithms for distributed stochastic principal component analysis
D Garber, O Shamir, N Srebro
International Conference on Machine Learning, 1203-1212, 2017
312017
Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems
D Garber, A Kaplan, S Sabach
Mathematical Programming 186 (1), 185-208, 2021
22*2021
Efficient coordinate-wise leading eigenvector computation
J Wang, W Wang, D Garber, N Srebro
Algorithmic Learning Theory, 806-820, 2018
212018
Sublinear time algorithms for approximate semidefinite programming
D Garber, E Hazan
Mathematical Programming 158 (1), 329-361, 2016
202016
Stochastic Canonical Correlation Analysis.
C Gao, D Garber, N Srebro, J Wang, W Wang
J. Mach. Learn. Res. 20, 167:1-167:46, 2019
192019
Efficient online linear optimization with approximation algorithms
D Garber
Advances in Neural Information Processing Systems 30, 2017
182017
Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and Sparsity
D Garber
arXiv preprint arXiv:2006.00558, 2020
132020
On the convergence of projected-gradient methods with low-rank projections for smooth convex minimization over trace-norm balls and related problems
D Garber
SIAM Journal on Optimization 31 (1), 727-753, 2021
112021
Improved regret bounds for projection-free bandit convex optimization
D Garber, B Kretzu
International Conference on Artificial Intelligence and Statistics, 2196-2206, 2020
112020
The system can't perform the operation now. Try again later.
Articles 1–20