Elad Hazan

引用次数

	总计	2020 年至今
引用	32460	19515
h 指数	66	52
i10 指数	137	119

4000

2000

1000

3000

20092010201120122013201420152016201720182019202020212022202320242025133 170 283 316 452 659 997 1606 2033 2657 3235 3682 3782 3738 3939 3902 469

开放获取的出版物数量

查看全部

43 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Satyen KaleResearch Scientist, Apple在 satyenkale.com 的电子邮件经过验证
Naman AgarwalSenior Research Scientist, Google AI Princeton在 google.com 的电子邮件经过验证
Karan SinghCarnegie Mellon University在 cmu.edu 的电子邮件经过验证
Sanjeev AroraProfessor of Computer Science, Princeton University在 princeton.edu 的电子邮件经过验证
Xinyi ChenPrinceton University, Google DeepMind在 princeton.edu 的电子邮件经过验证
Cyril ZhangMicrosoft Research NYC在 microsoft.com 的电子邮件经过验证
Brian BullinsAssistant Professor, Purdue University在 purdue.edu 的电子邮件经过验证
Tomer KorenAssociate Professor at Tel Aviv University在 tauex.tau.ac.il 的电子邮件经过验证
Dan GarberAssociate Professor at Technion - Israel Institute of Technology在 technion.ac.il 的电子邮件经过验证
John DuchiAssociate Professor of Statistics and Electrical Engineering, Stanford University在 stanford.edu 的电子邮件经过验证
Zeyuan Allen-ZhuMeta AI / FAIR Labs在 csail.mit.edu 的电子邮件经过验证
Jacob AbernethyAssistant Professor, University of Michigan在 umich.edu 的电子邮件经过验证
Sham M KakadeHarvard University在 seas.harvard.edu 的电子邮件经过验证
Udaya GhaiAmazon, NYC在 amazon.com 的电子邮件经过验证
Alexander RakhlinProfessor, MIT在 mit.edu 的电子邮件经过验证
Tengyu MAStanford University在 stanford.edu 的电子邮件经过验证
Zhou LuPhD student at Princeton在 princeton.edu 的电子邮件经过验证
Paula GraduPhD student, UC Berkeley在 berkeley.edu 的电子邮件经过验证
Shie MannorProfessor of Electrical Engineering @ Technion & Researcher @ Nvidia在 technion.ac.il 的电子邮件经过验证
Oren AnavaTechnion在 tx.technion.ac.il 的电子邮件经过验证

关注

Elad Hazan

Professor at Princeton University and Director Google AI Princeton

在 princeton.edu 的电子邮件经过验证 - 首页

Machine Learning Mathematical Optimization


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Adaptive subgradient methods for online learning and stochastic optimization. J Duchi, E Hazan, Y Singer Journal of machine learning research 12 (7), 2011	14871	2011
Introduction to online convex optimization E Hazan Foundations and Trends® in Optimization 2 (3-4), 157-325, 2016	2207	2016
Logarithmic regret algorithms for online convex optimization E Hazan, A Agarwal, S Kale Machine Learning 69 (2), 169-192, 2007	1399	2007
The multiplicative weights update method: a meta-algorithm and applications S Arora, E Hazan, S Kale Theory of computing 8 (1), 121-164, 2012	1308	2012
On the optimization of deep networks: Implicit acceleration by overparameterization S Arora, N Cohen, E Hazan International conference on machine learning, 244-253, 2018	584	2018
Variance reduction for faster non-convex optimization Z Allen-Zhu, E Hazan International conference on machine learning, 699-707, 2016	453	2016
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. JD Abernethy, E Hazan, A Rakhlin COLT, 263-274, 2008	419	2008
Second-order stochastic optimization for machine learning in linear time N Agarwal, B Bullins, E Hazan Journal of Machine Learning Research 18 (116), 1-40, 2017	361*	2017
Provably efficient maximum entropy exploration E Hazan, S Kakade, K Singh, A Van Soest International Conference on Machine Learning, 2681-2691, 2019	348	2019
Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization E Hazan, S Kale The Journal of Machine Learning Research 15 (1), 2489-2512, 2014	334	2014
Algorithms for portfolio management based on the newton method A Agarwal, E Hazan, S Kale, RE Schapire Proceedings of the 23rd international conference on Machine learning, 9-16, 2006	295	2006
Adaptive online gradient descent E Hazan, A Rakhlin, P Bartlett Advances in neural information processing systems 20, 2007	286	2007
Finding approximate local minima faster than gradient descent N Agarwal, Z Allen-Zhu, B Bullins, E Hazan, T Ma Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017	285	2017
Projection-free online learning E Hazan, S Kale arXiv preprint arXiv:1206.4657, 2012	275	2012
Online control with adversarial disturbances N Agarwal, B Bullins, E Hazan, S Kakade, K Singh International Conference on Machine Learning, 111-119, 2019	273	2019
On the complexity of approximating k-set packing E Hazan, S Safra, O Schwartz computational complexity 15 (1), 20-39, 2006	264*	2006
Efficient learning algorithms for changing environments E Hazan, C Seshadhri Proceedings of the 26th annual international conference on machine learning …, 2009	239	2009
Faster rates for the Frank-Wolfe method over strongly-convex sets D Garber, E Hazan International Conference on Machine Learning, 541-549, 2015	224	2015
Sparse approximate solutions to semidefinite programs E Hazan Latin American symposium on theoretical informatics, 306-316, 2008	209	2008
Beyond convexity: Stochastic quasi-convex optimization E Hazan, K Levy, S Shalev-Shwartz Advances in neural information processing systems 28, 2015	204	2015

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

关注

引用次数

合著作者