DBLP: Elad Hazan

	2013
j17		Dan Garber, Elad Hazan: Adaptive Universal Linear Filtering. IEEE Transactions on Signal Processing 61(7): 1595-1604 (2013)
i17		Dan Garber, Elad Hazan: A Polynomial Time Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization. CoRR abs/1301.4666 (2013)
i16		Oren Anava, Elad Hazan, Shie Mannor, Ohad Shamir: Online Learning for Time Series Prediction. CoRR abs/1302.6927 (2013)
i15		Oren Anava, Elad Hazan, Shie Mannor: Online Learning for Loss Functions with Memory and Applications to Statistical Arbitrage. CoRR abs/1302.6937 (2013)
	2012
j16		Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear optimization for machine learning. J. ACM 59(5): 23 (2012)
j15		Elad Hazan, Sham M. Kakade: (weak) Calibration is Computationally Hard. Journal of Machine Learning Research - Proceedings Track 23: 3.1-3.10 (2012)
j14		Elad Hazan, Satyen Kale, Shai Shalev-Shwartz: Near-Optimal Algorithms for Online Matrix Prediction. Journal of Machine Learning Research - Proceedings Track 23: 38.1-38.13 (2012)
j13		Jacob Abernethy, Elad Hazan, Alexander Rakhlin: Interior-Point Methods for Full-Information and Bandit Online Learning. IEEE Transactions on Information Theory 58(7): 4164-4175 (2012)
j12		Sanjeev Arora, Elad Hazan, Satyen Kale: The Multiplicative Weights Update Method: a Meta-Algorithm and Applications. Theory of Computing 8(1): 121-164 (2012)
c30		Elad Hazan, Satyen Kale: Projection-free Online Learning. ICML 2012
c29		Elad Hazan, Tomer Koren: Linear Regression with Limited Observation. ICML 2012
c28		Elad Hazan, Zohar Shay Karnin: A Polylog Pivot Steps Simplex Algorithm for Classification. NIPS 2012: 638-646
i14		Elad Hazan, Sham Kakade: (weak) Calibration is Computationally Hard. CoRR abs/1202.4478 (2012)
i13		Elad Hazan, Satyen Kale, Shai Shalev-Shwartz: Near-Optimal Algorithms for Online Matrix Prediction. CoRR abs/1204.0136 (2012)
i12		Elad Hazan, Satyen Kale: Projection-free Online Learning. CoRR abs/1206.4657 (2012)
i11		Elad Hazan, Tomer Koren: Linear Regression with Limited Observation. CoRR abs/1206.4678 (2012)
i10		Dan Garber, Elad Hazan: Almost Optimal Sublinear Time Algorithm for Semidefinite Programming. CoRR abs/1208.5211 (2012)
	2011
j11		Elad Hazan, Satyen Kale: Better Algorithms for Benign Bandits. Journal of Machine Learning Research 12: 1287-1311 (2011)
j10		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)
j9		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)
j8		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)
j7		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)
j6		Elad Hazan, Robert Krauthgamer: How Hard Is It to Approximate the Best Nash Equilibrium? SIAM J. Comput. 40(1): 79-91 (2011)
c27		Elad Hazan, Satyen Kale: Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction. NIPS 2011: 891-899
c26		Dan Garber, Elad Hazan: Approximating Semidefinite Programs in Sublinear Time. NIPS 2011: 1080-1088
c25		Elad Hazan, Tomer Koren, Nati Srebro: Beating SGD: Learning SVMs in Sublinear Time. NIPS 2011: 1233-1241
i9		Elad Hazan, Tomer Koren: Optimal Algorithms for Ridge and Lasso Regression with Partially Observed Attributes. CoRR abs/1108.4559 (2011)
i8		Dan Garber, Elad Hazan: Universal MMSE Filtering With Logarithmic Adaptive Regret. CoRR abs/1111.1136 (2011)
	2010
j5		Elad Hazan, Satyen Kale: Extracting certainty from uncertainty: regret bounded by variation in costs. Machine Learning 80(2-3): 165-188 (2010)
j4		Sanjeev Arora, Elad Hazan, Satyen Kale: O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n²) Time. SIAM J. Comput. 39(5): 1748-1771 (2010)
c24		Elad Hazan, Satyen Kale, Manfred K. Warmuth: Learning Rotations with Little Regret. COLT 2010: 144-154
c23		John C. Duchi, Elad Hazan, Yoram Singer: Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. COLT 2010: 257-269
c22		Elad Hazan, Satyen Kale, Manfred K. Warmuth: On-line Variance Minimization in O(n2) per Trial? COLT 2010: 314-315
c21		Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear Optimization for Machine Learning. FOCS 2010: 449-457
i7		Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear Optimization for Machine Learning. CoRR abs/1010.4408 (2010)
i6		Jacob Abernethy, Peter L. Bartlett, Elad Hazan: Blackwell Approachability and Low-Regret Learning are Equivalent. CoRR abs/1011.1936 (2010)
	2009
c20		Elad Hazan, C. Seshadhri: Efficient learning algorithms for changing environments. ICML 2009: 50
c19		Elad Hazan, Satyen Kale: Beyond Convexity: Online Submodular Minimization. NIPS 2009: 700-708
c18		Elad Hazan, Satyen Kale: On Stochastic and Worst-case Models for Investing. NIPS 2009: 709-717
c17		Elad Hazan, Satyen Kale: Better algorithms for benign bandits. SODA 2009: 38-47
c16		Elad Hazan, Robert Krauthgamer: How hard is it to approximate the best Nash equilibrium? SODA 2009: 720-727
	2008
c15		Elad Hazan, Satyen Kale: Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. COLT 2008: 57-68
c14		Jacob Abernethy, Elad Hazan, Alexander Rakhlin: Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. COLT 2008: 263-274
c13		Elad Hazan: Sparse Approximate Solutions to Semidefinite Programs. LATIN 2008: 306-316
	2007
j3		Elad Hazan, Amit Agarwal, Satyen Kale: Logarithmic regret algorithms for online convex optimization. Machine Learning 69(2-3): 169-192 (2007)
c12		Elad Hazan, Nimrod Megiddo: Online Learning with Prior Knowledge. COLT 2007: 499-513
c11		Peter L. Bartlett, Elad Hazan, Alexander Rakhlin: Adaptive Online Gradient Descent. NIPS 2007
c10		Elad Hazan, Satyen Kale: Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria. NIPS 2007
i5		Elad Hazan, C. Seshadhri: Adaptive Algorithms for Online Decision Problems. Electronic Colloquium on Computational Complexity (ECCC) 14(088) (2007)
	2006
j2		Elad Hazan, Shmuel Safra, Oded Schwartz: On the complexity of approximating k-set packing. Computational Complexity 15(1): 20-39 (2006)
j1		Eran Halperin, Elad Hazan: HAPLOFREQ-Estimating Haplotype Frequencies Efficiently. Journal of Computational Biology 13(2): 481-500 (2006)
c9		Sanjeev Arora, Elad Hazan, Satyen Kale: A Fast Random Sampling Algorithm for Sparsifying Matrices. APPROX-RANDOM 2006: 272-279
c8		Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal: Logarithmic Regret Algorithms for Online Convex Optimization. COLT 2006: 499-513
c7		Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire: Algorithms for portfolio management based on the Newton method. ICML 2006: 9-16
i4		Elad Hazan: Approximate Convex Optimization by Online Game Playing. CoRR abs/cs/0610119 (2006)
i3		Amit Agarwal, Elad Hazan: Efficient Algorithms for Online Game Playing and Universal Portfolio Management. Electronic Colloquium on Computational Complexity (ECCC) 13(033) (2006)
	2005
c6		Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra: On Non-Approximability for Quadratic Programs. FOCS 2005: 206-215
c5		Sanjeev Arora, Elad Hazan, Satyen Kale: Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. FOCS 2005: 339-348
c4		Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh: Analysis and Algorithms for Content-Based Event Matching. ICDCS Workshops 2005: 363-369
c3		Eran Halperin, Elad Hazan: HAPLOFREQ - Estimating Haplotype Frequencies E.ciently. RECOMB 2005: 553-568
i2		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
c2		Sanjeev Arora, Elad Hazan, Satyen Kale: 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n²) Time. FOCS 2004: 238-247
	2003
c1		Elad Hazan, Shmuel Safra, Oded Schwartz: On the Complexity of Approximating k-Dimensional Matching. RANDOM-APPROX 2003: 83-97
i1		Elad Hazan, Shmuel Safra, Oded Schwartz: On the Hardness of Approximating k-Dimensional Matching. Electronic Colloquium on Computational Complexity (ECCC) 10(020) (2003)

2013

j17

Dan Garber, Elad Hazan: Adaptive Universal Linear Filtering. IEEE Transactions on Signal Processing 61(7): 1595-1604 (2013)

i17

Dan Garber, Elad Hazan: A Polynomial Time Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization. CoRR abs/1301.4666 (2013)

i16

Oren Anava, Elad Hazan, Shie Mannor, Ohad Shamir: Online Learning for Time Series Prediction. CoRR abs/1302.6927 (2013)

i15

Oren Anava, Elad Hazan, Shie Mannor: Online Learning for Loss Functions with Memory and Applications to Statistical Arbitrage. CoRR abs/1302.6937 (2013)

2012

j16

Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear optimization for machine learning. J. ACM 59(5): 23 (2012)

j15

Elad Hazan, Sham M. Kakade: (weak) Calibration is Computationally Hard. Journal of Machine Learning Research - Proceedings Track 23: 3.1-3.10 (2012)

j14

Elad Hazan, Satyen Kale, Shai Shalev-Shwartz: Near-Optimal Algorithms for Online Matrix Prediction. Journal of Machine Learning Research - Proceedings Track 23: 38.1-38.13 (2012)

j13

Jacob Abernethy, Elad Hazan, Alexander Rakhlin: Interior-Point Methods for Full-Information and Bandit Online Learning. IEEE Transactions on Information Theory 58(7): 4164-4175 (2012)

j12

Sanjeev Arora, Elad Hazan, Satyen Kale: The Multiplicative Weights Update Method: a Meta-Algorithm and Applications. Theory of Computing 8(1): 121-164 (2012)

c30

Elad Hazan, Satyen Kale: Projection-free Online Learning. ICML 2012

c29

Elad Hazan, Tomer Koren: Linear Regression with Limited Observation. ICML 2012

c28

Elad Hazan, Zohar Shay Karnin: A Polylog Pivot Steps Simplex Algorithm for Classification. NIPS 2012: 638-646

i14

Elad Hazan, Sham Kakade: (weak) Calibration is Computationally Hard. CoRR abs/1202.4478 (2012)

i13

Elad Hazan, Satyen Kale, Shai Shalev-Shwartz: Near-Optimal Algorithms for Online Matrix Prediction. CoRR abs/1204.0136 (2012)

i12

Elad Hazan, Satyen Kale: Projection-free Online Learning. CoRR abs/1206.4657 (2012)

i11

Elad Hazan, Tomer Koren: Linear Regression with Limited Observation. CoRR abs/1206.4678 (2012)

i10

Dan Garber, Elad Hazan: Almost Optimal Sublinear Time Algorithm for Semidefinite Programming. CoRR abs/1208.5211 (2012)

2011

j11

Elad Hazan, Satyen Kale: Better Algorithms for Benign Bandits. Journal of Machine Learning Research 12: 1287-1311 (2011)

j10

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)

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)

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)

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)

Elad Hazan, Robert Krauthgamer: How Hard Is It to Approximate the Best Nash Equilibrium? SIAM J. Comput. 40(1): 79-91 (2011)

c27

Elad Hazan, Satyen Kale: Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction. NIPS 2011: 891-899

c26

Dan Garber, Elad Hazan: Approximating Semidefinite Programs in Sublinear Time. NIPS 2011: 1080-1088

c25

Elad Hazan, Tomer Koren, Nati Srebro: Beating SGD: Learning SVMs in Sublinear Time. NIPS 2011: 1233-1241

Elad Hazan, Tomer Koren: Optimal Algorithms for Ridge and Lasso Regression with Partially Observed Attributes. CoRR abs/1108.4559 (2011)

Dan Garber, Elad Hazan: Universal MMSE Filtering With Logarithmic Adaptive Regret. CoRR abs/1111.1136 (2011)

2010

Elad Hazan, Satyen Kale: Extracting certainty from uncertainty: regret bounded by variation in costs. Machine Learning 80(2-3): 165-188 (2010)

Sanjeev Arora, Elad Hazan, Satyen Kale: O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n²) Time. SIAM J. Comput. 39(5): 1748-1771 (2010)

c24

Elad Hazan, Satyen Kale, Manfred K. Warmuth: Learning Rotations with Little Regret. COLT 2010: 144-154

c23

John C. Duchi, Elad Hazan, Yoram Singer: Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. COLT 2010: 257-269

c22

Elad Hazan, Satyen Kale, Manfred K. Warmuth: On-line Variance Minimization in O(n2) per Trial? COLT 2010: 314-315

c21

Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear Optimization for Machine Learning. FOCS 2010: 449-457

Kenneth L. Clarkson, Elad Hazan, David P. Woodruff: Sublinear Optimization for Machine Learning. CoRR abs/1010.4408 (2010)

Jacob Abernethy, Peter L. Bartlett, Elad Hazan: Blackwell Approachability and Low-Regret Learning are Equivalent. CoRR abs/1011.1936 (2010)

2009

c20

Elad Hazan, C. Seshadhri: Efficient learning algorithms for changing environments. ICML 2009: 50

c19

Elad Hazan, Satyen Kale: Beyond Convexity: Online Submodular Minimization. NIPS 2009: 700-708

c18

Elad Hazan, Satyen Kale: On Stochastic and Worst-case Models for Investing. NIPS 2009: 709-717

c17

Elad Hazan, Satyen Kale: Better algorithms for benign bandits. SODA 2009: 38-47

c16

Elad Hazan, Robert Krauthgamer: How hard is it to approximate the best Nash equilibrium? SODA 2009: 720-727

2008

c15

Elad Hazan, Satyen Kale: Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. COLT 2008: 57-68

c14

Jacob Abernethy, Elad Hazan, Alexander Rakhlin: Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. COLT 2008: 263-274

c13

Elad Hazan: Sparse Approximate Solutions to Semidefinite Programs. LATIN 2008: 306-316

2007

Elad Hazan, Amit Agarwal, Satyen Kale: Logarithmic regret algorithms for online convex optimization. Machine Learning 69(2-3): 169-192 (2007)

c12

Elad Hazan, Nimrod Megiddo: Online Learning with Prior Knowledge. COLT 2007: 499-513

c11

Peter L. Bartlett, Elad Hazan, Alexander Rakhlin: Adaptive Online Gradient Descent. NIPS 2007

c10

Elad Hazan, Satyen Kale: Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria. NIPS 2007

Elad Hazan, C. Seshadhri: Adaptive Algorithms for Online Decision Problems. Electronic Colloquium on Computational Complexity (ECCC) 14(088) (2007)

2006

Elad Hazan, Shmuel Safra, Oded Schwartz: On the complexity of approximating k-set packing. Computational Complexity 15(1): 20-39 (2006)

Eran Halperin, Elad Hazan: HAPLOFREQ-Estimating Haplotype Frequencies Efficiently. Journal of Computational Biology 13(2): 481-500 (2006)

Sanjeev Arora, Elad Hazan, Satyen Kale: A Fast Random Sampling Algorithm for Sparsifying Matrices. APPROX-RANDOM 2006: 272-279

Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal: Logarithmic Regret Algorithms for Online Convex Optimization. COLT 2006: 499-513

Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire: Algorithms for portfolio management based on the Newton method. ICML 2006: 9-16

Elad Hazan: Approximate Convex Optimization by Online Game Playing. CoRR abs/cs/0610119 (2006)

Amit Agarwal, Elad Hazan: Efficient Algorithms for Online Game Playing and Universal Portfolio Management. Electronic Colloquium on Computational Complexity (ECCC) 13(033) (2006)

2005

Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra: On Non-Approximability for Quadratic Programs. FOCS 2005: 206-215

Sanjeev Arora, Elad Hazan, Satyen Kale: Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. FOCS 2005: 339-348

Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh: Analysis and Algorithms for Content-Based Event Matching. ICDCS Workshops 2005: 363-369

Eran Halperin, Elad Hazan: HAPLOFREQ - Estimating Haplotype Frequencies E.ciently. RECOMB 2005: 553-568

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

Sanjeev Arora, Elad Hazan, Satyen Kale: 0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n²) Time. FOCS 2004: 238-247

2003

Elad Hazan, Shmuel Safra, Oded Schwartz: On the Complexity of Approximating k-Dimensional Matching. RANDOM-APPROX 2003: 83-97

Elad Hazan, Shmuel Safra, Oded Schwartz: On the Hardness of Approximating k-Dimensional Matching. Electronic Colloquium on Computational Complexity (ECCC) 10(020) (2003)

1	Jacob D. Abernethy (Jacob Abernethy)	[j13] [j9] [i6] [c14]
2	Amit Agarwal	[j3] [c8] [c7] [i3]
3	Oren Anava	[i16] [i15]
4	Sanjeev Arora	[j12] [j4] [c9] [c6] [c5] [i2] [c2]
5	Peter L. Bartlett	[j9] [i6] [c11]
6	Eli Berger	[c6] [i2]
7	Fengyun Cao	[c4]
8	Kenneth L. Clarkson	[j16] [c21] [i7]
9	Seshadhri Comandur (C. Seshadhri)	[c20] [i5]
10	John C. Duchi	[j10] [c23]
11	Dan Garber	[j17] [i17] [i10] [c26] [i8]
12	Eran Halperin	[j1] [c3]
13	Sham M. Kakade (Sham Kakade)	[j15] [i14]
14	Adam Tauman Kalai (Adam Kalai)	[c8]
15	Satyen Kale	[j14] [j12] [c30] [i13] [i12] [j11] [j8] [j7] [c27] [j5] [j4] [c24] [c22] [c19] [c18] [c17] [c15] [j3] [c10] [c9] [c8] [c7] [c5] [c4] [c2]
16	Zohar Shay Karnin	[c28]
17	Guy Kindler	[c6] [i2]
18	Tomer Koren	[c29] [i11] [c25] [i9]
19	Robert Krauthgamer	[j6] [c16]
20	Shie Mannor	[i16] [i15]
21	Nimrod Megiddo	[c12]
22	Alexander Rakhlin (Sasha Rakhlin)	[j13] [c14] [c11]
23	Shmuel Safra (Muli Safra)	[j2] [c6] [i2] [c1] [i1]
24	Robert E. Schapire	[c7]
25	Oded Schwartz	[j2] [c1] [i1]
26	Shai Shalev-Shwartz	[j14] [i13]
27	Ohad Shamir	[i16]
28	Yoram Singer	[j10] [c23]
29	Jaswinder Pal Singh	[c4]
30	Nathan Srebro (Nati Srebro)	[c25]
31	Manfred K. Warmuth	[c24] [c22]
32	David P. Woodruff	[j16] [c21] [i7]

Elad Hazan

Coauthor Index