Прати
Dan Garber
Dan Garber
Associate Professor at Technion - Israel Institute of Technology
Верификована је имејл адреса на technion.ac.il - Почетна страница
Наслов
Навело
Навело
Година
Faster rates for the Frank-Wolfe method over strongly-convex sets
D Garber, E Hazan
International Conference on Machine Learning, 541-549, 2015
2252015
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
1772016
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
110*2016
Fast and simple PCA via convex optimization
D Garber, E Hazan
arXiv preprint arXiv:1509.05647, 2015
1072015
Online principal components analysis
C Boutsidis, D Garber, Z Karnin, E Liberty
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
882014
Communication-efficient algorithms for distributed stochastic principal component analysis
D Garber, O Shamir, N Srebro
International Conference on Machine Learning, 1203-1212, 2017
602017
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
592016
Online learning of eigenvectors
D Garber, E Hazan, T Ma
International Conference on Machine Learning, 560-568, 2015
552015
Playing non-linear games with linear oracles
D Garber, E Hazan
2013 IEEE 54th annual symposium on foundations of computer science, 420-428, 2013
472013
Approximating semidefinite programs in sublinear time
D Garber, E Hazan
Advances in Neural Information Processing Systems 24, 2011
472011
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
462016
Faster Projection-free Convex Optimization over the Spectrahedron
D Garber
arxiv, 2016
392016
Sublinear time algorithms for approximate semidefinite programming
D Garber, E Hazan
Mathematical Programming 158, 329-361, 2016
362016
Stochastic canonical correlation analysis
C Gao, D Garber, N Srebro, J Wang, W Wang
Journal of Machine Learning Research 20 (167), 1-46, 2019
342019
Improved regret bounds for projection-free bandit convex optimization
D Garber, B Kretzu
International Conference on Artificial Intelligence and Statistics, 2196-2206, 2020
322020
Efficient online linear optimization with approximation algorithms
D Garber
Advances in Neural Information Processing Systems 30, 2017
322017
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
30*2021
New projection-free algorithms for online convex optimization with adaptive regret guarantees
D Garber, B Kretzu
Conference on Learning Theory, 2326-2359, 2022
292022
Revisiting projection-free online learning: the strongly convex case
B Kretzu, D Garber
International Conference on Artificial Intelligence and Statistics, 3592-3600, 2021
292021
Revisiting Frank-Wolfe for Polytopes: Strict Complementarity and Sparsity
D Garber
arXiv preprint arXiv:2006.00558, 2020
272020
Систем тренутно не може да изврши ову радњу. Пробајте поново касније.
Чланци 1–20