Elad Hazan

	2012
49		Elad Hazan, Sham Kakade: (weak) Calibration is Computationally Hard CoRR abs/1202.4478: (2012)
48		Elad Hazan, Satyen Kale, Shai Shalev-Shwartz: Near-Optimal Algorithms for Online Matrix Prediction CoRR abs/1204.0136: (2012)
	2011
47		Dan Garber, Elad Hazan: Approximating Semidefinite Programs in Sublinear Time. NIPS 2011: 1080-1088
46		Elad Hazan, Tomer Koren, Nati Srebro: Beating SGD: Learning SVMs in Sublinear Time. NIPS 2011: 1233-1241
45		Elad Hazan, Satyen Kale: Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction. NIPS 2011: 891-899
44		Elad Hazan, Tomer Koren: Optimal Algorithms for Ridge and Lasso Regression with Partially Observed Attributes CoRR abs/1108.4559: (2011)
43		Dan Garber, Elad Hazan: Universal MMSE Filtering With Logarithmic Adaptive Regret CoRR abs/1111.1136: (2011)
42		Elad Hazan, Satyen Kale: Better Algorithms for Benign Bandits. Journal of Machine Learning Research 12: 1287-1311 (2011)
41		John C. Duchi, Elad Hazan, Yoram Singer: Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. Journal of Machine Learning Research 12: 2121-2159 (2011)
40		Jacob Abernethy, Peter L. Bartlett, Elad Hazan: Blackwell Approachability and No-Regret Learning are Equivalent. Journal of Machine Learning Research - Proceedings Track 19: 27-46 (2011)
39		Elad Hazan, Satyen Kale: Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization. Journal of Machine Learning Research - Proceedings Track 19: 421-436 (2011)
38		Elad Hazan, Satyen Kale: A simple multi-armed bandit algorithm with optimal variation-bounded regret. Journal of Machine Learning Research - Proceedings Track 19: 817-820 (2011)
37		Elad Hazan, Robert Krauthgamer: How Hard Is It to Approximate the Best Nash Equilibrium? SIAM J. Comput. 40(1): 79-91 (2011)
	2010
36		Elad Hazan, Satyen Kale, Manfred K. Warmuth: Learning Rotations with Little Regret. COLT 2010: 144-154
35		John C. Duchi, Elad Hazan, Yoram Singer: Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. COLT 2010: 257-269
34		Elad Hazan, Satyen Kale, Manfred K. Warmuth: On-line Variance Minimization in O(n2) per Trial? COLT 2010: 314-315
33		Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear Optimization for Machine Learning. FOCS 2010: 449-457
32		Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear Optimization for Machine Learning CoRR abs/1010.4408: (2010)
31		Jacob Abernethy, Peter L. Bartlett, Elad Hazan: Blackwell Approachability and Low-Regret Learning are Equivalent CoRR abs/1011.1936: (2010)
30		Elad Hazan, Satyen Kale: Extracting certainty from uncertainty: regret bounded by variation in costs. Machine Learning 80(2-3): 165-188 (2010)
29		Sanjeev Arora, Elad Hazan, Satyen Kale: O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n2) Time. SIAM J. Comput. 39(5): 1748-1771 (2010)
	2009
28		Elad Hazan, C. Seshadhri: Efficient learning algorithms for changing environments. ICML 2009: 50
27		Elad Hazan, Satyen Kale: Beyond Convexity: Online Submodular Minimization. NIPS 2009: 700-708
26		Elad Hazan, Satyen Kale: On Stochastic and Worst-case Models for Investing. NIPS 2009: 709-717
25		Elad Hazan, Satyen Kale: Better algorithms for benign bandits. SODA 2009: 38-47
24		Elad Hazan, Robert Krauthgamer: How hard is it to approximate the best Nash equilibrium? SODA 2009: 720-727
	2008
23		Jacob Abernethy, Elad Hazan, Alexander Rakhlin: Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. COLT 2008: 263-274
22		Elad Hazan, Satyen Kale: Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. COLT 2008: 57-68
21		Elad Hazan: Sparse Approximate Solutions to Semidefinite Programs. LATIN 2008: 306-316
	2007
20		Elad Hazan, Nimrod Megiddo: Online Learning with Prior Knowledge. COLT 2007: 499-513
19		Peter L. Bartlett, Elad Hazan, Alexander Rakhlin: Adaptive Online Gradient Descent. NIPS 2007
18		Elad Hazan, Satyen Kale: Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria. NIPS 2007
17		Elad Hazan, C. Seshadhri: Adaptive Algorithms for Online Decision Problems. Electronic Colloquium on Computational Complexity (ECCC) 14(088): (2007)
16		Elad Hazan, Amit Agarwal, Satyen Kale: Logarithmic regret algorithms for online convex optimization. Machine Learning 69(2-3): 169-192 (2007)
	2006
15		Sanjeev Arora, Elad Hazan, Satyen Kale: A Fast Random Sampling Algorithm for Sparsifying Matrices. APPROX-RANDOM 2006: 272-279
14		Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal: Logarithmic Regret Algorithms for Online Convex Optimization. COLT 2006: 499-513
13		Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire: Algorithms for portfolio management based on the Newton method. ICML 2006: 9-16
12		Elad Hazan: Approximate Convex Optimization by Online Game Playing CoRR abs/cs/0610119: (2006)
11		Elad Hazan, Shmuel Safra, Oded Schwartz: On the complexity of approximating k-set packing. Computational Complexity 15(1): 20-39 (2006)
10		Amit Agarwal, Elad Hazan: Efficient Algorithms for Online Game Playing and Universal Portfolio Management. Electronic Colloquium on Computational Complexity (ECCC) 13(033): (2006)
9		Eran Halperin, Elad Hazan: HAPLOFREQ-Estimating Haplotype Frequencies Efficiently. Journal of Computational Biology 13(2): 481-500 (2006)
	2005
8		Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra: On Non-Approximability for Quadratic Programs. FOCS 2005: 206-215
7		Sanjeev Arora, Elad Hazan, Satyen Kale: Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. FOCS 2005: 339-348
6		Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh: Analysis and Algorithms for Content-Based Event Matching. ICDCS Workshops 2005: 363-369
5		Eran Halperin, Elad Hazan: HAPLOFREQ - Estimating Haplotype Frequencies E.ciently. RECOMB 2005: 553-568
4		Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra: On Non-Approximability for Quadratic Programs Electronic Colloquium on Computational Complexity (ECCC)(058): (2005)
	2004
3		Sanjeev Arora, Elad Hazan, Satyen Kale: 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n2) Time. FOCS 2004: 238-247
	2003
2		Elad Hazan, Shmuel Safra, Oded Schwartz: On the Complexity of Approximating k-Dimensional Matching. RANDOM-APPROX 2003: 83-97
1		Elad Hazan, Shmuel Safra, Oded Schwartz: On the Hardness of Approximating k-Dimensional Matching Electronic Colloquium on Computational Complexity (ECCC) 10(020): (2003)

Coauthor Index

1	Jacob Abernethy	[23] [31] [40]
2	Amit Agarwal	[10] [13] [14] [16]
3	Sanjeev Arora	[3] [4] [7] [8] [15] [29]
4	Peter L. Bartlett	[19] [31] [40]
5	Eli Berger	[4] [8]
6	Fengyun Cao	[6]
7	Kenneth L. Clarkson	[32] [33]
8	Seshadhri Comandur (C. Seshadhri)	[17] [28]
9	John C. Duchi	[35] [41]
10	Dan Garber	[43] [47]
11	Eran Halperin	[5] [9]
12	Sham M. Kakade (Sham Kakade)	[49]
13	Adam Tauman Kalai (Adam Kalai)	[14]
14	Satyen Kale	[3] [6] [7] [13] [14] [15] [16] [18] [22] [25] [26] [27] [29] [30] [34] [36] [38] [39] [42] [45] [48]
15	Guy Kindler	[4] [8]
16	Tomer Koren	[44] [46]
17	Robert Krauthgamer	[24] [37]
18	Nimrod Megiddo	[20]
19	Alexander Rakhlin	[19] [23]
20	Shmuel Safra (Muli Safra)	[1] [2] [4] [8] [11]
21	Robert E. Schapire	[13]
22	Oded Schwartz	[1] [2] [11]
23	Shai Shalev-Shwartz	[48]
24	Yoram Singer	[35] [41]
25	Jaswinder Pal Singh	[6]
26	Nathan Srebro (Nati Srebro)	[46]
27	Manfred K. Warmuth	[34] [36]
28	David P. Woodruff	[32] [33]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page