Elad Hazan - RankMe

257 papers A* 81B 7Misc 1Journal 138Unranked 30

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	SFO: Learning PDE Operators via Spectral Filtering. CoRR Noam Koren, Rafael Moschopoulos, Kira Radinsky, Elad Hazan
2026	J	`jnl`	Spectral Filtering for Learning Quantum Dynamics. CoRR Elad Hazan, Annie Marsden
2025	J	`jnl`	A New Approach to Controlling Linear Dynamical Systems. CoRR Anand Brahmbhatt, Gon Buzaglo, Sofiia Druchyna, Elad Hazan
2025	J	`jnl`	Dimension-free Regret for Learning Asymmetric Linear Dynamical Systems. CoRR Annie Marsden, Elad Hazan
2025	J	`jnl`	Efficient Spectral Control of Partially Observed Linear Dynamical Systems. CoRR Anand Brahmbhatt, Gon Buzaglo, Sofiia Druchyna, Elad Hazan
2025	—	`conf`	Flash STU: Fast Spectral Transform Units. CDC Y. Isabel Liu, Windsor Nguyen, Yagiz Devre, Evan Dogariu, Anirudha Majumdar, Elad Hazan
2025	A*	`conf`	Provable Length Generalization in Sequence Prediction via Spectral Filtering. ICML Annie Marsden, Evan Dogariu, Naman Agarwal, Xinyi Chen, Daniel Suo, Elad Hazan
2025	J	`jnl`	Research Program: Theory of Learning in Dynamical Systems. CoRR Elad Hazan, Shai Shalev-Shwartz, Nathan Srebro
2025	J	`jnl`	SpectraLDS: Provable Distillation for Linear Dynamical Systems. CoRR Devan Shah, Shlomo Fortgang, Sofiia Druchyna, Elad Hazan
2025	J	`jnl`	The Hidden Game Problem. CoRR Gon Buzaglo, Noah Golowich, Elad Hazan
2025	J	`jnl`	Universal Learning of Nonlinear Dynamics. CoRR Evan Dogariu, Anand Brahmbhatt, Elad Hazan
2024	J	`jnl`	Adaptive Online Learning of Quantum States. Quantum Xinyi Chen, Elad Hazan, Tongyang Li, Zhou Lu, Xinzhao Wang, Rui Yang
2024	A*	`conf`	Adaptive Regret for Bandits Made Possible: Two Queries Suffice. ICLR Zhou Lu, Qiuyi Zhang, Xinyi Chen, Fred Zhang, David P. Woodruff, Elad Hazan
2024	J	`jnl`	Adaptive Regret for Bandits Made Possible: Two Queries Suffice. CoRR Zhou Lu, Qiuyi Zhang, Xinyi Chen, Fred Zhang, David P. Woodruff, Elad Hazan
2024	J	`jnl`	Chain of LoRA: Efficient Fine-tuning of Language Models via Residual Learning. CoRR Wenhan Xia, Chengwei Qin, Elad Hazan
2024	J	`jnl`	Flash STU: Fast Spectral Transform Units. CoRR Y. Isabel Liu, Windsor Nguyen, Yagiz Devre, Evan Dogariu, Anirudha Majumdar, Elad Hazan
2024	J	`jnl`	FutureFill: Fast Generation from Convolutional Sequence Models. CoRR Naman Agarwal, Xinyi Chen, Evan Dogariu, Vladimir Feinberg, Daniel Suo, Peter L. Bartlett, Elad Hazan
2024	A*	`conf`	Online Control in Population Dynamics. NeurIPS Noah Golowich, Elad Hazan, Zhou Lu, Dhruv Rohatgi, Y. Jennifer Sun
2024	J	`jnl`	Online Control in Population Dynamics. CoRR Noah Golowich, Elad Hazan, Zhou Lu, Dhruv Rohatgi, Y. Jennifer Sun
2024	A*	`conf`	Open Problem: Black-Box Reductions and Adaptive Gradient Methods for Nonconvex Optimization. COLT Xinyi Chen, Elad Hazan
2024	J	`jnl`	Provable Length Generalization in Sequence Prediction via Spectral Filtering. CoRR Annie Marsden, Evan Dogariu, Naman Agarwal, Xinyi Chen, Daniel Suo, Elad Hazan
2024	A*	`conf`	Second Order Methods for Bandit Optimization and Control. COLT Arun Suggala, Y. Jennifer Sun, Praneeth Netrapalli, Elad Hazan
2024	J	`jnl`	Second Order Methods for Bandit Optimization and Control. CoRR Arun Suggala, Y. Jennifer Sun, Praneeth Netrapalli, Elad Hazan
2023	J	`jnl`	A Nonstochastic Control Approach to Optimization. CoRR Xinyi Chen, Elad Hazan
2023	J	`jnl`	AI safety by debate via regret minimization. CoRR Xinyi Chen, Angelica Chen, Dean P. Foster, Elad Hazan
2023	—	`conf`	Adaptive Regret for Control of Time-Varying Dynamics. L4DC Paula Gradu, Elad Hazan, Edgar Minasyan
2023	J	`jnl`	An Efficient Interior-Point Method for Online Convex Optimization. CoRR Elad Hazan, Nimrod Megiddo
2023	—	`conf`	Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret. L4DC Gautam Goel, Naman Agarwal, Karan Singh, Elad Hazan
2023	J	`jnl`	Boosting Simple Learners. TheoretiCS Noga Alon, Alon Gonen, Elad Hazan, Shay Moran
2023	A*	`conf`	Online Control for Meta-optimization. NeurIPS Xinyi Chen, Elad Hazan
2023	Misc	`conf`	Online Learning for Obstacle Avoidance. CoRL David Snyder, Meghan Booker, Nathaniel Simon, Wenhan Xia, Daniel Suo, Elad Hazan, Anirudha Majumdar
2023	J	`jnl`	Online Learning for Obstacle Avoidance. CoRR David Snyder, Meghan Booker, Nathaniel Simon, Wenhan Xia, Daniel Suo, Elad Hazan, Anirudha Majumdar
2023	A*	`conf`	Online Nonstochastic Model-Free Reinforcement Learning. NeurIPS Udaya Ghai, Arushi Gupta, Wenhan Xia, Karan Singh, Elad Hazan
2023	J	`jnl`	Online Nonstochastic Model-Free Reinforcement Learning. CoRR Udaya Ghai, Arushi Gupta, Wenhan Xia, Karan Singh, Elad Hazan
2023	A*	`conf`	Optimal Rates for Bandit Nonstochastic Control. NeurIPS Y. Jennifer Sun, Stephen H. Newman, Elad Hazan
2023	J	`jnl`	Optimal Rates for Bandit Nonstochastic Control. CoRR Y. Jennifer Sun, Stephen H. Newman, Elad Hazan
2023	A*	`conf`	Partial Matrix Completion. NeurIPS Elad Hazan, Adam Tauman Kalai, Varun Kanade, Clara Mohri, Y. Jennifer Sun
2023	B	`conf`	Projection-free Adaptive Regret with Membership Oracles. ALT Zhou Lu, Nataly Brukhim, Paula Gradu, Elad Hazan
2023	—	`conf`	Regret Guarantees for Online Deep Control. L4DC Xinyi Chen, Edgar Minasyan, Jason D. Lee, Elad Hazan
2023	A*	`conf`	Sketchy: Memory-efficient Adaptive Regularization with Frequent Directions. NeurIPS Vladimir Feinberg, Xinyi Chen, Y. Jennifer Sun, Rohan Anil, Elad Hazan
2023	J	`jnl`	Sketchy: Memory-efficient Adaptive Regularization with Frequent Directions. CoRR Vladimir Feinberg, Xinyi Chen, Y. Jennifer Sun, Rohan Anil, Elad Hazan
2023	J	`jnl`	Spectral State Space Models. CoRR Naman Agarwal, Daniel Suo, Xinyi Chen, Elad Hazan
2022	A*	`conf`	A Boosting Approach to Reinforcement Learning. NeurIPS Nataly Brukhim, Elad Hazan, Karan Singh
2022	J	`jnl`	A Regret Minimization Approach to Multi-Agent Contro. CoRR Udaya Ghai, Udari Madhushani, Naomi Ehrich Leonard, Elad Hazan
2022	A*	`conf`	A Regret Minimization Approach to Multi-Agent Control. ICML Udaya Ghai, Udari Madhushani, Naomi Ehrich Leonard, Elad Hazan
2022	J	`jnl`	Adaptive Gradient Methods with Local Guarantees. CoRR Zhou Lu, Wenhan Xia, Sanjeev Arora, Elad Hazan
2022	J	`jnl`	Adaptive Online Learning of Quantum States. CoRR Xinyi Chen, Elad Hazan, Tongyang Li, Zhou Lu, Xinzhao Wang, Rui Yang
2022	J	`jnl`	Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret. CoRR Gautam Goel, Naman Agarwal, Karan Singh, Elad Hazan
2022	J	`jnl`	Efficient Adaptive Regret Minimization. CoRR Zhou Lu, Elad Hazan
2022	J	`jnl`	Introduction to Online Nonstochastic Control. CoRR Elad Hazan, Karan Singh
2022	A*	`conf`	Non-convex online learning via algorithmic equivalence. NeurIPS Udaya Ghai, Zhou Lu, Elad Hazan
2022	J	`jnl`	Non-convex online learning via algorithmic equivalence. CoRR Udaya Ghai, Zhou Lu, Elad Hazan
2022	J	`jnl`	Online Control of Unknown Time-Varying Dynamical Systems. CoRR Edgar Minasyan, Paula Gradu, Max Simchowitz, Elad Hazan
2022	J	`jnl`	Partial Matrix Completion. CoRR Varun Kanade, Elad Hazan, Adam Tauman Kalai
2022	J	`jnl`	Projection-free Adaptive Regret with Membership Oracles. CoRR Zhou Lu, Nataly Brukhim, Paula Gradu, Elad Hazan
2022	—	`conf`	Robust Online Control with Model Misspecification. L4DC Udaya Ghai, Xinyi Chen, Elad Hazan, Alexandre Megretski
2021	J	`jnl`	A Boosting Approach to Reinforcement Learning. CoRR Nataly Brukhim, Elad Hazan, Karan Singh
2021	A*	`conf`	A Regret Minimization Approach to Iterative Learning Control. ICML Naman Agarwal, Elad Hazan, Anirudha Majumdar, Karan Singh
2021	J	`jnl`	A Regret Minimization Approach to Iterative Learning Control. CoRR Naman Agarwal, Elad Hazan, Anirudha Majumdar, Karan Singh
2021	A*	`conf`	Black-Box Control for Linear Dynamical Systems. COLT Xinyi Chen, Elad Hazan
2021	A*	`conf`	Boosting for Online Convex Optimization. ICML Elad Hazan, Karan Singh
2021	J	`jnl`	Boosting for Online Convex Optimization. CoRR Elad Hazan, Karan Singh
2021	A*	`conf`	Boosting simple learners. STOC Noga Alon, Alon Gonen, Elad Hazan, Shay Moran
2021	J	`jnl`	Deluca - A Differentiable Control Library: Environments, Methods, and Benchmarking. CoRR Paula Gradu, John Hallman, Daniel Suo, Alex Yu, Naman Agarwal, Udaya Ghai, Karan Singh, Cyril Zhang, Anirudha Majumdar, Elad Hazan
2021	—	`conf`	Generating Adversarial Disturbances for Controller Verification. L4DC Udaya Ghai, David Snyder, Anirudha Majumdar, Elad Hazan
2021	J	`jnl`	Machine Learning for Mechanical Ventilation Control (Extended Abstract). CoRR Daniel Suo, Cyril Zhang, Paula Gradu, Udaya Ghai, Xinyi Chen, Edgar Minasyan, Naman Agarwal, Karan Singh, Julienne LaChance, Tom Zajdel, Manuel Schottdorf, Daniel J. Cohen, Elad Hazan
2021	J	`jnl`	Machine Learning for Mechanical Ventilation Control. CoRR Daniel Suo, Cyril Zhang, Paula Gradu, Udaya Ghai, Xinyi Chen, Edgar Minasyan, Naman Agarwal, Karan Singh, Julienne LaChance, Tom Zajdel, Manuel Schottdorf, Daniel J. Cohen, Elad Hazan
2021	A*	`conf`	Multiclass Boosting and the Cost of Weak Learning. NeurIPS Nataly Brukhim, Elad Hazan, Shay Moran, Indraneel Mukherjee, Robert E. Schapire
2021	B	`conf`	Online Boosting with Bandit Feedback. ALT Nataly Brukhim, Elad Hazan
2021	A*	`conf`	Online Control of Unknown Time-Varying Dynamical Systems. NeurIPS Edgar Minasyan, Paula Gradu, Max Simchowitz, Elad Hazan
2021	J	`jnl`	Provable Regret Bounds for Deep Online Learning and Control. CoRR Xinyi Chen, Edgar Minasyan, Jason D. Lee, Elad Hazan
2021	J	`jnl`	Robust Online Control with Model Misspecification. CoRR Xinyi Chen, Udaya Ghai, Elad Hazan, Alexandre Megretski
2020	J	`jnl`	Adaptive Regret for Control of Time-Varying Dynamics. CoRR Paula Gradu, Elad Hazan, Edgar Minasyan
2020	J	`jnl`	Black-Box Control for Linear Dynamical Systems. CoRR Xinyi Chen, Elad Hazan
2020	J	`jnl`	Boosting Simple Learners. CoRR Noga Alon, Alon Gonen, Elad Hazan, Shay Moran
2020	A*	`conf`	Boosting for Control of Dynamical Systems. ICML Naman Agarwal, Nataly Brukhim, Elad Hazan, Zhou Lu
2020	J	`jnl`	Disentangling Adaptive Gradient Methods from Learning Rates. CoRR Naman Agarwal, Rohan Anil, Elad Hazan, Tomer Koren, Cyril Zhang
2020	B	`conf`	Exponentiated Gradient Meets Gradient Descent. ALT Udaya Ghai, Elad Hazan, Yoram Singer
2020	A*	`conf`	Extreme Tensoring for Low-Memory Preconditioning. ICLR Xinyi Chen, Naman Agarwal, Elad Hazan, Cyril Zhang, Yi Zhang
2020	A*	`conf`	Faster Projection-free Online Learning. COLT Elad Hazan, Edgar Minasyan
2020	J	`jnl`	Faster Projection-free Online Learning. CoRR Elad Hazan, Edgar Minasyan
2020	J	`jnl`	Generating Adversarial Disturbances for Controller Verification. CoRR Udaya Ghai, David Snyder, Anirudha Majumdar, Elad Hazan
2020	A*	`conf`	Geometric Exploration for Online Control. NeurIPS Orestis Plevrakis, Elad Hazan
2020	J	`jnl`	Geometric Exploration for Online Control. CoRR Orestis Plevrakis, Elad Hazan
2020	A*	`conf`	Improper Learning for Non-Stochastic Control. COLT Max Simchowitz, Karan Singh, Elad Hazan
2020	J	`jnl`	Improper Learning for Non-Stochastic Control. CoRR Max Simchowitz, Karan Singh, Elad Hazan
2020	A*	`conf`	Non-Stochastic Control with Bandit Feedback. NeurIPS Paula Gradu, John Hallman, Elad Hazan
2020	J	`jnl`	Non-Stochastic Control with Bandit Feedback. CoRR Paula Gradu, John Hallman, Elad Hazan
2020	A*	`conf`	Online Agnostic Boosting via Regret Minimization. NeurIPS Nataly Brukhim, Xinyi Chen, Elad Hazan, Shay Moran
2020	J	`jnl`	Online Agnostic Boosting via Regret Minimization. CoRR Nataly Brukhim, Xinyi Chen, Elad Hazan, Shay Moran
2020	J	`jnl`	Online Boosting with Bandit Feedback. CoRR Nataly Brukhim, Elad Hazan
2020	A*	`conf`	The Gradient Complexity of Linear Regression. COLT Mark Braverman, Elad Hazan, Max Simchowitz, Blake E. Woodworth
2020	B	`conf`	The Nonstochastic Control Problem. ALT Elad Hazan, Sham M. Kakade, Karan Singh
2019	J	`jnl`	Boosting for Dynamical Systems. CoRR Naman Agarwal, Nataly Brukhim, Elad Hazan, Zhou Lu
2019	A*	`conf`	Efficient Full-Matrix Adaptive Regularization. ICML Naman Agarwal, Brian Bullins, Xinyi Chen, Elad Hazan, Karan Singh, Cyril Zhang, Yi Zhang
2019	J	`jnl`	Exponentiated Gradient Meets Gradient Descent. CoRR Udaya Ghai, Elad Hazan, Yoram Singer
2019	J	`jnl`	Extreme Tensoring for Low-Memory Preconditioning. CoRR Xinyi Chen, Naman Agarwal, Elad Hazan, Cyril Zhang, Yi Zhang
2019	B	`conf`	Generalize Across Tasks: Efficient Algorithms for Linear Representation Learning. ALT Brian Bullins, Elad Hazan, Adam Kalai, Roi Livni
2019	J	`jnl`	Introduction to Online Convex Optimization. CoRR Elad Hazan
2019	A*	`conf`	Learning in Non-convex Games with an Optimization Oracle. COLT Naman Agarwal, Alon Gonen, Elad Hazan
2019	J	`jnl`	Lecture Notes: Optimization for Machine Learning. CoRR Elad Hazan
2019	A*	`conf`	Logarithmic Regret for Online Control. NeurIPS Naman Agarwal, Elad Hazan, Karan Singh
2019	J	`jnl`	Logarithmic Regret for Online Control. CoRR Naman Agarwal, Elad Hazan, Karan Singh
2019	A*	`conf`	Online Control with Adversarial Disturbances. ICML Naman Agarwal, Brian Bullins, Elad Hazan, Sham M. Kakade, Karan Singh
2019	J	`jnl`	Online Control with Adversarial Disturbances. CoRR Naman Agarwal, Brian Bullins, Elad Hazan, Sham M. Kakade, Karan Singh
2019	A*	`conf`	Private Learning Implies Online Learning: An Efficient Reduction. NeurIPS Alon Gonen, Elad Hazan, Shay Moran
2019	J	`jnl`	Private Learning Implies Online Learning: An Efficient Reduction. CoRR Alon Gonen, Elad Hazan, Shay Moran
2019	A*	`conf`	Provably Efficient Maximum Entropy Exploration. ICML Elad Hazan, Sham M. Kakade, Karan Singh, Abby Van Soest
2019	J	`jnl`	The Nonstochastic Control Problem. CoRR Elad Hazan, Sham M. Kakade, Karan Singh
2019	J	`jnl`	The gradient complexity of linear regression. CoRR Mark Braverman, Elad Hazan, Max Simchowitz, Blake E. Woodworth
2018	—	`conf`	Hyperparameter optimization: a spectral approach. ICLR (Poster) Elad Hazan, Adam R. Klivans, Yang Yuan
2018	J	`jnl`	Learning in Non-convex Games with an Optimization Oracle. CoRR Alon Gonen, Elad Hazan
2018	A*	`conf`	Lower Bounds for Higher-Order Convex Optimization. COLT Naman Agarwal, Elad Hazan
2018	A*	`conf`	On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization. ICML Sanjeev Arora, Nadav Cohen, Elad Hazan
2018	J	`jnl`	On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization. CoRR Sanjeev Arora, Nadav Cohen, Elad Hazan
2018	A*	`conf`	Online Improper Learning with an Approximation Oracle. NeurIPS Elad Hazan, Wei Hu, Yuanzhi Li, Zhiyuan Li
2018	J	`jnl`	Online Improper Learning with an Approximation Oracle. CoRR Elad Hazan, Wei Hu, Yuanzhi Li, Zhiyuan Li
2018	A*	`conf`	Online Learning of Quantum States. NeurIPS Scott Aaronson, Xinyi Chen, Elad Hazan, Satyen Kale, Ashwin Nayak
2018	J	`jnl`	Online Learning of Quantum States. CoRR Scott Aaronson, Xinyi Chen, Elad Hazan, Ashwin Nayak
2018	A*	`conf`	Open problem: Improper learning of mixtures of Gaussians. COLT Elad Hazan, Roi Livni
2018	J	`jnl`	Provably Efficient Maximum Entropy Exploration. CoRR Elad Hazan, Sham M. Kakade, Karan Singh, Abby Van Soest
2018	A*	`conf`	Spectral Filtering for General Linear Dynamical Systems. NeurIPS Elad Hazan, Holden Lee, Karan Singh, Cyril Zhang, Yi Zhang
2018	J	`jnl`	Spectral Filtering for General Linear Dynamical Systems. CoRR Elad Hazan, Holden Lee, Karan Singh, Cyril Zhang, Yi Zhang
2018	J	`jnl`	The Case for Full-Matrix Adaptive Regularization. CoRR Naman Agarwal, Brian Bullins, Xinyi Chen, Elad Hazan, Karan Singh, Cyril Zhang, Yi Zhang
2018	—	`conf`	Towards Provable Control for Unknown Linear Dynamical Systems. ICLR (Workshop) Sanjeev Arora, Elad Hazan, Holden Lee, Karan Singh, Cyril Zhang, Yi Zhang
2017	A*	`conf`	Efficient Regret Minimization in Non-Convex Games. ICML Elad Hazan, Karan Singh, Cyril Zhang
2017	J	`jnl`	Efficient Regret Minimization in Non-Convex Games. CoRR Elad Hazan, Karan Singh, Cyril Zhang
2017	A*	`conf`	Finding approximate local minima faster than gradient descent. STOC Naman Agarwal, Zeyuan Allen Zhu, Brian Bullins, Elad Hazan, Tengyu Ma
2017	J	`jnl`	Hyperparameter Optimization: A Spectral Approach. CoRR Elad Hazan, Adam R. Klivans, Yang Yuan
2017	—	`conf`	Learning Linear Dynamical Systems via Spectral Filtering. NIPS Elad Hazan, Karan Singh, Cyril Zhang
2017	J	`jnl`	Learning Linear Dynamical Systems via Spectral Filtering. CoRR Elad Hazan, Karan Singh, Cyril Zhang
2017	—	`conf`	Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls. NIPS Zeyuan Allen-Zhu, Elad Hazan, Wei Hu, Yuanzhi Li
2017	J	`jnl`	Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls. CoRR Zeyuan Allen-Zhu, Elad Hazan, Wei Hu, Yuanzhi Li
2017	J	`jnl`	Lower Bounds for Higher-Order Convex Optimization. CoRR Naman Agarwal, Elad Hazan
2017	J	`jnl`	Near-Optimal Algorithms for Online Matrix Prediction. SIAM J. Comput. Elad Hazan, Satyen Kale, Shai Shalev-Shwartz
2017	J	`jnl`	Second-Order Stochastic Optimization for Machine Learning in Linear Time. J. Mach. Learn. Res. Naman Agarwal, Brian Bullins, Elad Hazan
2016	J	`jnl`	A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization. SIAM J. Optim. Dan Garber, Elad Hazan
2016	—	`conf`	A Non-generative Framework and Convex Relaxations for Unsupervised Learning. NIPS Elad Hazan, Tengyu Ma
2016	J	`jnl`	A Non-generative Framework and Convex Relaxations for Unsupervised Learning. CoRR Elad Hazan, Tengyu Ma
2016	J	`jnl`	A linear-time algorithm for trust region problems. Math. Program. Elad Hazan, Tomer Koren
2016	J	`jnl`	An optimal algorithm for bandit convex optimization. CoRR Elad Hazan, Yuanzhi Li
2016	A*	`conf`	Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier. ICML Jacob D. Abernethy, Elad Hazan
2016	A*	`conf`	Faster Eigenvector Computation via Shift-and-Invert Preconditioning. ICML Dan Garber, Elad Hazan, Chi Jin, Sham M. Kakade, Cameron Musco, Praneeth Netrapalli, Aaron Sidford
2016	J	`jnl`	Faster Eigenvector Computation via Shift-and-Invert Preconditioning. CoRR Dan Garber, Elad Hazan, Chi Jin, Sham M. Kakade, Cameron Musco, Praneeth Netrapalli, Aaron Sidford
2016	J	`jnl`	Finding Approximate Local Minima for Nonconvex Optimization in Linear Time. CoRR Naman Agarwal, Zeyuan Allen Zhu, Brian Bullins, Elad Hazan, Tengyu Ma
2016	J	`jnl`	Introduction to Online Convex Optimization. Found. Trends Optim. Elad Hazan
2016	J	`jnl`	Learning rotations with little regret. Mach. Learn. Elad Hazan, Satyen Kale, Manfred K. Warmuth
2016	A*	`conf`	On Graduated Optimization for Stochastic Non-Convex Problems. ICML Elad Hazan, Kfir Yehuda Levy, Shai Shalev-Shwartz
2016	A*	`conf`	Online Learning with Low Rank Experts. COLT Elad Hazan, Tomer Koren, Roi Livni, Yishay Mansour
2016	J	`jnl`	Online Learning with Low Rank Experts. CoRR Elad Hazan, Tomer Koren, Roi Livni, Yishay Mansour
2016	—	`conf`	Optimal Black-Box Reductions Between Optimization Objectives. NIPS Zeyuan Allen Zhu, Elad Hazan
2016	J	`jnl`	Optimal Black-Box Reductions Between Optimization Objectives. CoRR Zeyuan Allen Zhu, Elad Hazan
2016	J	`jnl`	Second Order Stochastic Optimization in Linear Time. CoRR Naman Agarwal, Brian Bullins, Elad Hazan
2016	J	`jnl`	Sublinear time algorithms for approximate semidefinite programming. Math. Program. Dan Garber, Elad Hazan
2016	—	`conf`	The Limits of Learning with Missing Data. NIPS Brian Bullins, Elad Hazan, Tomer Koren
2016	A*	`conf`	The computational power of optimization in online learning. STOC Elad Hazan, Tomer Koren
2016	A*	`conf`	Variance Reduction for Faster Non-Convex Optimization. ICML Zeyuan Allen Zhu, Elad Hazan
2016	J	`jnl`	Variance Reduction for Faster Non-Convex Optimization. CoRR Zeyuan Allen Zhu, Elad Hazan
2016	A*	`conf`	Variance-Reduced and Projection-Free Stochastic Optimization. ICML Elad Hazan, Haipeng Luo
2016	J	`jnl`	Variance-Reduced and Projection-Free Stochastic Optimization. CoRR Elad Hazan, Haipeng Luo
2016	J	`jnl`	Volumetric Spanners: An Efficient Exploration Basis for Learning. J. Mach. Learn. Res. Elad Hazan, Zohar S. Karnin
2015	—	`conf`	Beyond Convexity: Stochastic Quasi-Convex Optimization. NIPS Elad Hazan, Kfir Y. Levy, Shai Shalev-Shwartz
2015	J	`jnl`	Beyond Convexity: Stochastic Quasi-Convex Optimization. CoRR Elad Hazan, Kfir Y. Levy, Shai Shalev-Shwartz
2015	A*	`conf`	Classification with Low Rank and Missing Data. ICML Elad Hazan, Roi Livni, Yishay Mansour
2015	J	`jnl`	Classification with Low Rank and Missing Data. CoRR Elad Hazan, Roi Livni, Yishay Mansour
2015	A*	`conf`	Conference on Learning Theory 2015: Preface. COLT Peter Grünwald, Elad Hazan
2015	J	`jnl`	Fast and Simple PCA via Convex Optimization. CoRR Dan Garber, Elad Hazan
2015	J	`jnl`	Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier. CoRR Jacob D. Abernethy, Elad Hazan
2015	A*	`conf`	Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets. ICML Dan Garber, Elad Hazan
2015	J	`jnl`	On Graduated Optimization for Stochastic Non-Convex Problems. CoRR Elad Hazan, Kfir Y. Levy, Shai Shalev-Shwartz
2015	—	`conf`	Online Gradient Boosting. NIPS Alina Beygelzimer, Elad Hazan, Satyen Kale, Haipeng Luo
2015	J	`jnl`	Online Gradient Boosting. CoRR Alina Beygelzimer, Elad Hazan, Satyen Kale, Haipeng Luo
2015	—	`conf`	Online Learning for Adversaries with Memory: Price of Past Mistakes. NIPS Oren Anava, Elad Hazan, Shie Mannor
2015	A*	`conf`	Online Learning of Eigenvectors. ICML Dan Garber, Elad Hazan, Tengyu Ma
2015	A*	`conf`	Online Time Series Prediction with Missing Data. ICML Oren Anava, Elad Hazan, Assaf Zeevi
2015	J	`jnl`	Oracle-Based Robust Optimization via Online Learning. Oper. Res. Aharon Ben-Tal, Elad Hazan, Tomer Koren, Shie Mannor
2015	A*	`ed.`	Proceedings of The 28th Conference on Learning Theory, COLT 2015, Paris, France, July 3-6, 2015 COLT Peter Grünwald, Elad Hazan, Satyen Kale
2015	J	`jnl`	The Computational Power of Optimization in Online Learning. CoRR Elad Hazan, Tomer Koren
2014	J	`jnl`	A Linear-Time Algorithm for Trust Region Problems. CoRR Elad Hazan, Tomer Koren
2014	—	`conf`	Bandit Convex Optimization: Towards Tight Bounds. NIPS Elad Hazan, Kfir Y. Levy
2014	J	`jnl`	Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization. J. Mach. Learn. Res. Elad Hazan, Satyen Kale
2014	J	`jnl`	Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets. CoRR Dan Garber, Elad Hazan
2014	A*	`conf`	Hard-Margin Active Linear Regression. ICML Zohar Shay Karnin, Elad Hazan
2014	A*	`conf`	Logistic Regression: Tight Bounds for Stochastic and Online Optimization. COLT Elad Hazan, Tomer Koren, Kfir Y. Levy
2014	J	`jnl`	Logistic Regression: Tight Bounds for Stochastic and Online Optimization. CoRR Elad Hazan, Tomer Koren, Kfir Y. Levy
2014	J	`jnl`	Oracle-Based Robust Optimization via Online Learning. CoRR Aharon Ben-Tal, Elad Hazan, Tomer Koren, Shie Mannor
2014	—	`conf`	The Blinded Bandit: Learning with Adaptive Feedback. NIPS Ofer Dekel, Elad Hazan, Tomer Koren
2014	A*	`conf`	Volumetric Spanners: an Efficient Exploration Basis for Learning. COLT Elad Hazan, Zohar Shay Karnin, Raghu Meka
2013	J	`jnl`	A Polynomial Time Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization CoRR Dan Garber, Elad Hazan
2013	J	`jnl`	Adaptive Universal Linear Filtering. IEEE Trans. Signal Process. Dan Garber, Elad Hazan
2013	—	`conf`	Better Rates for Any Adversarial Deterministic MDP. ICML (3) Ofer Dekel, Elad Hazan
2013	J	`jnl`	Online Learning for Loss Functions with Memory and Applications to Statistical Arbitrage CoRR Oren Anava, Elad Hazan, Shie Mannor
2013	J	`jnl`	Online Learning for Time Series Prediction CoRR Oren Anava, Elad Hazan, Shie Mannor, Ohad Shamir
2013	A*	`conf`	Online Learning for Time Series Prediction. COLT Oren Anava, Elad Hazan, Shie Mannor, Ohad Shamir
2013	A*	`conf`	Playing Non-linear Games with Linear Oracles. FOCS Dan Garber, Elad Hazan
2013	J	`jnl`	Volumetric Spanners and their Applications to Machine Learning. CoRR Elad Hazan, Zohar Shay Karnin, Raghu Meka
2012	J	`jnl`	(weak) Calibration is Computationally Hard CoRR Elad Hazan, Sham M. Kakade
2012	A*	`conf`	(weak) Calibration is Computationally Hard. COLT Elad Hazan, Sham M. Kakade
2012	—	`conf`	A Polylog Pivot Steps Simplex Algorithm for Classification. NIPS Elad Hazan, Zohar Shay Karnin
2012	J	`jnl`	Almost Optimal Sublinear Time Algorithm for Semidefinite Programming CoRR Dan Garber, Elad Hazan
2012	J	`jnl`	Interior-Point Methods for Full-Information and Bandit Online Learning. IEEE Trans. Inf. Theory Jacob D. Abernethy, Elad Hazan, Alexander Rakhlin
2012	J	`jnl`	Linear Regression with Limited Observation CoRR Elad Hazan, Tomer Koren
2012	A*	`conf`	Linear Regression with Limited Observation. ICML Elad Hazan, Tomer Koren
2012	J	`jnl`	Near-Optimal Algorithms for Online Matrix Prediction CoRR Elad Hazan, Satyen Kale, Shai Shalev-Shwartz
2012	A*	`conf`	Near-Optimal Algorithms for Online Matrix Prediction. COLT Elad Hazan, Satyen Kale, Shai Shalev-Shwartz
2012	J	`jnl`	Online submodular minimization. J. Mach. Learn. Res. Elad Hazan, Satyen Kale
2012	J	`jnl`	Projection-free Online Learning CoRR Elad Hazan, Satyen Kale
2012	A*	`conf`	Projection-free Online Learning. ICML Elad Hazan, Satyen Kale
2012	J	`jnl`	Sublinear optimization for machine learning. J. ACM Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
2012	J	`jnl`	The Multiplicative Weights Update Method: a Meta-Algorithm and Applications. Theory Comput. Sanjeev Arora, Elad Hazan, Satyen Kale
2011	A*	`conf`	A simple multi-armed bandit algorithm with optimal variation-bounded regret. COLT Elad Hazan, Satyen Kale
2011	J	`jnl`	Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. J. Mach. Learn. Res. John C. Duchi, Elad Hazan, Yoram Singer
2011	—	`conf`	Approximating Semidefinite Programs in Sublinear Time. NIPS Dan Garber, Elad Hazan
2011	—	`conf`	Beating SGD: Learning SVMs in Sublinear Time. NIPS Elad Hazan, Tomer Koren, Nati Srebro
2011	J	`jnl`	Better Algorithms for Benign Bandits. J. Mach. Learn. Res. Elad Hazan, Satyen Kale
2011	A*	`conf`	Beyond the regret minimization barrier: an optimal algorithm for stochastic strongly-convex optimization. COLT Elad Hazan, Satyen Kale
2011	A*	`conf`	Blackwell Approachability and No-Regret Learning are Equivalent. COLT Jacob D. Abernethy, Peter L. Bartlett, Elad Hazan
2011	J	`jnl`	How Hard Is It to Approximate the Best Nash Equilibrium? SIAM J. Comput. Elad Hazan, Robert Krauthgamer
2011	—	`conf`	Newtron: an Efficient Bandit algorithm for Online Multiclass Prediction. NIPS Elad Hazan, Satyen Kale
2011	J	`jnl`	Optimal Algorithms for Ridge and Lasso Regression with Partially Observed Attributes CoRR Elad Hazan, Tomer Koren
2011	J	`jnl`	Universal MMSE Filtering With Logarithmic Adaptive Regret CoRR Dan Garber, Elad Hazan
2010	A*	`conf`	Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. COLT John C. Duchi, Elad Hazan, Yoram Singer
2010	J	`jnl`	Blackwell Approachability and Low-Regret Learning are Equivalent CoRR Jacob D. Abernethy, Peter L. Bartlett, Elad Hazan
2010	J	`jnl`	Extracting certainty from uncertainty: regret bounded by variation in costs. Mach. Learn. Elad Hazan, Satyen Kale
2010	A*	`conf`	Learning Rotations with Little Regret. COLT Elad Hazan, Satyen Kale, Manfred K. Warmuth
2010	J	`jnl`	O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n SIAM J. Comput. Sanjeev Arora, Elad Hazan, Satyen Kale
2010	A*	`conf`	On-line Variance Minimization in O(n2) per Trial? COLT Elad Hazan, Satyen Kale, Manfred K. Warmuth
2010	J	`jnl`	Sublinear Optimization for Machine Learning CoRR Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
2010	A*	`conf`	Sublinear Optimization for Machine Learning. FOCS Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
2009	A*	`conf`	Better algorithms for benign bandits. SODA Elad Hazan, Satyen Kale
2009	—	`conf`	Beyond Convexity: Online Submodular Minimization. NIPS Elad Hazan, Satyen Kale
2009	A*	`conf`	Efficient learning algorithms for changing environments. ICML Elad Hazan, C. Seshadhri
2009	A*	`conf`	How hard is it to approximate the best Nash equilibrium? SODA Elad Hazan, Robert Krauthgamer
2009	—	`conf`	On Stochastic and Worst-case Models for Investing. NIPS Elad Hazan, Satyen Kale
2008	A*	`conf`	Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. COLT Jacob D. Abernethy, Elad Hazan, Alexander Rakhlin
2008	A*	`conf`	Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs. COLT Elad Hazan, Satyen Kale
2008	B	`conf`	Sparse Approximate Solutions to Semidefinite Programs. LATIN Elad Hazan
2007	J	`jnl`	Adaptive Algorithms for Online Decision Problems. Electron. Colloquium Comput. Complex. Elad Hazan, C. Seshadhri
2007	—	`conf`	Adaptive Online Gradient Descent. NIPS Peter L. Bartlett, Elad Hazan, Alexander Rakhlin
2007	—	`conf`	Computational Equivalence of Fixed Points and No Regret Algorithms, and Convergence to Equilibria. NIPS Elad Hazan, Satyen Kale
2007	J	`jnl`	Logarithmic regret algorithms for online convex optimization. Mach. Learn. Elad Hazan, Amit Agarwal, Satyen Kale
2007	A*	`conf`	Online Learning with Prior Knowledge. COLT Elad Hazan, Nimrod Megiddo
2006	—	`conf`	A Fast Random Sampling Algorithm for Sparsifying Matrices. APPROX-RANDOM Sanjeev Arora, Elad Hazan, Satyen Kale
2006	A*	`conf`	Algorithms for portfolio management based on the Newton method. ICML Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire
2006	J	`jnl`	Approximate Convex Optimization by Online Game Playing CoRR Elad Hazan
2006	J	`jnl`	Efficient Algorithms for Online Game Playing and Universal Portfolio Management. Electron. Colloquium Comput. Complex. Amit Agarwal, Elad Hazan
2006	J	`jnl`	HAPLOFREQ-Estimating Haplotype Frequencies Efficiently. J. Comput. Biol. Eran Halperin, Elad Hazan
2006	A*	`conf`	Logarithmic Regret Algorithms for Online Convex Optimization. COLT Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
2006	J	`jnl`	On the complexity of approximating Comput. Complex. Elad Hazan, Shmuel Safra, Oded Schwartz
2005	—	`conf`	Analysis and Algorithms for Content-Based Event Matching. ICDCS Workshops Satyen Kale, Elad Hazan, Fengyun Cao, Jaswinder Pal Singh
2005	A*	`conf`	Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method. FOCS Sanjeev Arora, Elad Hazan, Satyen Kale
2005	B	`conf`	HAPLOFREQ - Estimating Haplotype Frequencies E.ciently. RECOMB Eran Halperin, Elad Hazan
2005	J	`jnl`	On Non-Approximability for Quadratic Programs Electron. Colloquium Comput. Complex. Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
2005	A*	`conf`	On Non-Approximability for Quadratic Programs. FOCS Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra
2004	A*	`conf`	0(sqrt (log n)) Approximation to SPARSEST CUT in Õ(n FOCS Sanjeev Arora, Elad Hazan, Satyen Kale
2003	—	`conf`	On the Complexity of Approximating k-Dimensional Matching. RANDOM-APPROX Elad Hazan, Shmuel Safra, Oded Schwartz
2003	J	`jnl`	On the Hardness of Approximating k-Dimensional Matching Electron. Colloquium Comput. Complex. Elad Hazan, Shmuel Safra, Oded Schwartz