Dan Garber
Dan Garber
Verifierad e-postadress på technion.ac.il - Startsida
TitelCiteras avÅr
Faster rates for the frank-wolfe method over strongly-convex sets
D Garber, E Hazan
32nd International Conference on Machine Learning, ICML 2015, 2015
962015
Fast and simple PCA via convex optimization
D Garber, E Hazan
arXiv preprint arXiv:1509.05647, 2015
732015
Faster Eigenvector Computation via Shift-and-Invert Preconditioning.
D Garber, E Hazan, C Jin, SM Kakade, C Musco, P Netrapalli, A Sidford
ICML, 2626-2634, 2016
62*2016
A linearly convergent conditional gradient algorithm with applications to online and stochastic optimization
D Garber, E Hazan
arXiv preprint arXiv:1301.4666, 2013
592013
Online principal components analysis
C Boutsidis, D Garber, Z Karnin, E Liberty
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
542014
Online Learning of Eigenvectors.
D Garber, E Hazan, T Ma
ICML, 560-568, 2015
372015
Approximating semidefinite programs in sublinear time
D Garber, E Hazan
Advances in Neural Information Processing Systems, 1080-1088, 2011
312011
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
262016
Playing non-linear games with linear oracles
D Garber, E Hazan
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 420-428, 2013
242013
Linear-memory and decomposition-invariant linearly convergent conditional gradient algorithm for structured polytopes
D Garber, O Meshi
Advances in neural information processing systems, 1001-1009, 2016
182016
Efficient globally convergent stochastic optimization for canonical correlation analysis
W Wang, J Wang, D Garber, N Srebro
Advances in Neural Information Processing Systems, 766-774, 2016
172016
Faster Projection-free Convex Optimization over the Spectrahedron
D Garber
arxiv, 2016
162016
Communication-efficient algorithms for distributed stochastic principal component analysis
D Garber, O Shamir, N Srebro
Proceedings of the 34th International Conference on Machine Learning-Volume …, 2017
112017
Sublinear time algorithms for approximate semidefinite programming
D Garber, E Hazan
Mathematical Programming 158 (1-2), 329-361, 2016
112016
Fast generalized conditional gradient method with applications to matrix recovery problems
D Garber, S Sabach, A Kaplan
arXiv preprint arXiv:1802.05581, 2018
92018
Efficient coordinate-wise leading eigenvector computation
J Wang, W Wang, D Garber, N Srebro
arXiv preprint arXiv:1702.07834, 2017
92017
Stochastic canonical correlation analysis
C Gao, D Garber, N Srebro, J Wang, W Wang
Journal of Machine Learning Research 20 (167), 1-46, 2019
72019
Fast Rates for Online Gradient Descent Without Strong Convexity via Hoffman's Bound
D Garber
arXiv preprint arXiv:1802.04623, 2018
42018
Efficient online linear optimization with approximation algorithms
D Garber
Advances in Neural Information Processing Systems, 627-635, 2017
42017
Fast stochastic algorithms for low-rank and nonsmooth matrix problems
D Garber, A Kaplan
arXiv preprint arXiv:1809.10477, 2018
32018
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20