Hazan, Elad

121 publications

NeurIPS 2025 Efficient Spectral Control of Partially Observed Linear Dynamical Systems Anand Paresh Brahmbhatt, Gon Buzaglo, Sofiia Druchyna, Elad Hazan

ICML 2025 Provable Length Generalization in Sequence Prediction via Spectral Filtering Annie Marsden, Evan Dogariu, Naman Agarwal, Xinyi Chen, Daniel Suo, Elad Hazan

NeurIPS 2025 SpectraLDS: Provable Distillation for Linear Dynamical Systems Devan Shah, Shlomo Fortgang, Sofiia Druchyna, Elad Hazan

NeurIPS 2025 Universal Sequence Preconditioning Annie Marsden, Elad Hazan

ICLR 2024 Adaptive Regret for Bandits Made Possible: Two Queries Suffice Zhou Lu, Qiuyi Zhang, Xinyi Chen, Fred Zhang, David Woodruff, Elad Hazan

ICMLW 2024 Chain of LoRA: Efficient Fine-Tuning of Language Models via Residual Learning Wenhan Xia, Chengwei Qin, Elad Hazan

ICMLW 2024 Meta-Optimization for Deep Learning via Nonstochastic Control Xinyi Chen, Evan Dogariu, Zhou Lu, Elad Hazan

ICMLW 2024 Nonconvex Meta-Optimization for Deep Learning Xinyi Chen, Evan Dogariu, Zhou Lu, Elad Hazan

NeurIPS 2024 Online Control in Population Dynamics Noah Golowich, Elad Hazan, Zhou Lu, Dhruv Rohatgi, Y. Jennifer Sun

COLT 2024 Open Problem: Black-Box Reductions and Adaptive Gradient Methods for Nonconvex Optimization Xinyi Chen, Elad Hazan

ICMLW 2024 Playing Large Games with Oracles and AI Debate Xinyi Chen, Angelica Chen, Dean Foster, Elad Hazan

COLT 2024 Second Order Methods for Bandit Optimization and Control Arun Suggala, Y Jennifer Sun, Praneeth Netrapalli, Elad Hazan

ICMLW 2024 Spectral State Space Models Naman Agarwal, Daniel Suo, Xinyi Chen, Elad Hazan

L4DC 2023 Adaptive Regret for Control of Time-Varying Dynamics Paula Gradu, Elad Hazan, Edgar Minasyan

L4DC 2023 Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret Gautam Goel, Naman Agarwal, Karan Singh, Elad Hazan

NeurIPS 2023 Online Control for Meta-Optimization Xinyi Chen, Elad Hazan

CoRL 2023 Online Learning for Obstacle Avoidance David Snyder, Meghan Booker, Nathaniel Simon, Wenhan Xia, Daniel Suo, Elad Hazan, Anirudha Majumdar

NeurIPS 2023 Online Nonstochastic Model-Free Reinforcement Learning Udaya Ghai, Arushi Gupta, Wenhan Xia, Karan Singh, Elad Hazan

NeurIPS 2023 Optimal Rates for Bandit Nonstochastic Control Y. Jennifer Sun, Stephen Newman, Elad Hazan

NeurIPS 2023 Partial Matrix Completion Elad Hazan, Adam Tauman Kalai, Varun Kanade, Clara Mohri, Y. Jennifer Sun

ALT 2023 Projection-Free Adaptive Regret with Membership Oracles Zhou Lu, Nataly Brukhim, Paula Gradu, Elad Hazan

L4DC 2023 Regret Guarantees for Online Deep Control Xinyi Chen, Edgar Minasyan, Jason D. Lee, Elad Hazan

NeurIPS 2023 Sketchy: Memory-Efficient Adaptive Regularization with Frequent Directions Vladimir Feinberg, Xinyi Chen, Y. Jennifer Sun, Rohan Anil, Elad Hazan

NeurIPS 2022 A Boosting Approach to Reinforcement Learning Nataly Brukhim, Elad Hazan, Karan Singh

ICML 2022 A Regret Minimization Approach to Multi-Agent Control Udaya Ghai, Udari Madhushani, Naomi Leonard, Elad Hazan

ICLRW 2022 A Regret Minimization Approach to Multi-Agent Control Udaya Ghai, Udari Madhushani, Naomi Leonard, Elad Hazan

NeurIPS 2022 Non-Convex Online Learning via Algorithmic Equivalence Udaya Ghai, Zhou Lu, Elad Hazan

L4DC 2022 Robust Online Control with Model Misspecification Udaya Ghai, Xinyi Chen, Elad Hazan, Alexandre Megretski

ICML 2021 A Regret Minimization Approach to Iterative Learning Control Naman Agarwal, Elad Hazan, Anirudha Majumdar, Karan Singh

COLT 2021 Black-Box Control for Linear Dynamical Systems Xinyi Chen, Elad Hazan

ICML 2021 Boosting for Online Convex Optimization Elad Hazan, Karan Singh

L4DC 2021 Generating Adversarial Disturbances for Controller Verification Udaya Ghai, David Snyder, Anirudha Majumdar, Elad Hazan

NeurIPS 2021 Multiclass Boosting and the Cost of Weak Learning Nataly Brukhim, Elad Hazan, Shay Moran, Indraneel Mukherjee, Robert E. Schapire

ALT 2021 Online Boosting with Bandit Feedback Nataly Brukhim, Elad Hazan

NeurIPS 2021 Online Control of Unknown Time-Varying Dynamical Systems Edgar Minasyan, Paula Gradu, Max Simchowitz, Elad Hazan

ICML 2020 Boosting for Control of Dynamical Systems Naman Agarwal, Nataly Brukhim, Elad Hazan, Zhou Lu

ALT 2020 Exponentiated Gradient Meets Gradient Descent Udaya Ghai, Elad Hazan, Yoram Singer

ICLR 2020 Extreme Tensoring for Low-Memory Preconditioning Xinyi Chen, Naman Agarwal, Elad Hazan, Cyril Zhang, Yi Zhang

COLT 2020 Faster Projection-Free Online Learning Elad Hazan, Edgar Minasyan

NeurIPS 2020 Geometric Exploration for Online Control Orestis Plevrakis, Elad Hazan

COLT 2020 Improper Learning for Non-Stochastic Control Max Simchowitz, Karan Singh, Elad Hazan

NeurIPS 2020 Non-Stochastic Control with Bandit Feedback Paula Gradu, John Hallman, Elad Hazan

NeurIPS 2020 Online Agnostic Boosting via Regret Minimization Nataly Brukhim, Xinyi Chen, Elad Hazan, Shay Moran

ICLR 2020 Revisiting the Generalization of Adaptive Gradient Methods Naman Agarwal, Rohan Anil, Elad Hazan, Tomer Koren, Cyril Zhang

COLT 2020 The Gradient Complexity of Linear Regression Mark Braverman, Elad Hazan, Max Simchowitz, Blake Woodworth

ALT 2020 The Nonstochastic Control Problem Elad Hazan, Sham Kakade, Karan Singh

ICML 2019 Efficient Full-Matrix Adaptive Regularization Naman Agarwal, Brian Bullins, Xinyi Chen, Elad Hazan, Karan Singh, Cyril Zhang, Yi Zhang

ALT 2019 Generalize Across Tasks: Efficient Algorithms for Linear Representation Learning Brian Bullins, Elad Hazan, Adam Kalai, Roi Livni

COLT 2019 Learning in Non-Convex Games with an Optimization Oracle Naman Agarwal, Alon Gonen, Elad Hazan

NeurIPS 2019 Logarithmic Regret for Online Control Naman Agarwal, Elad Hazan, Karan Singh

ICML 2019 Online Control with Adversarial Disturbances Naman Agarwal, Brian Bullins, Elad Hazan, Sham Kakade, Karan Singh

NeurIPS 2019 Private Learning Implies Online Learning: An Efficient Reduction Alon Gonen, Elad Hazan, Shay Moran

ICML 2019 Provably Efficient Maximum Entropy Exploration Elad Hazan, Sham Kakade, Karan Singh, Abby Van Soest

ICLR 2018 Hyperparameter Optimization: A Spectral Approach Elad Hazan, Adam Klivans, Yang Yuan

COLT 2018 Lower Bounds for Higher-Order Convex Optimization Naman Agarwal, Elad Hazan

ICML 2018 On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization Sanjeev Arora, Nadav Cohen, Elad Hazan

NeurIPS 2018 Online Improper Learning with an Approximation Oracle Elad Hazan, Wei Hu, Yuanzhi Li, Zhiyuan Li

NeurIPS 2018 Online Learning of Quantum States Scott Aaronson, Xinyi Chen, Elad Hazan, Satyen Kale, Ashwin Nayak

COLT 2018 Open Problem: Improper Learning of Mixtures of Gaussians Elad Hazan, Roi Livni

NeurIPS 2018 Spectral Filtering for General Linear Dynamical Systems Elad Hazan, Holden Lee, Karan Singh, Cyril Zhang, Yi Zhang

ICML 2017 Efficient Regret Minimization in Non-Convex Games Elad Hazan, Karan Singh, Cyril Zhang

NeurIPS 2017 Learning Linear Dynamical Systems via Spectral Filtering Elad Hazan, Karan Singh, Cyril Zhang

NeurIPS 2017 Linear Convergence of a Frank-Wolfe Type Algorithm over Trace-Norm Balls Zeyuan Allen-Zhu, Elad Hazan, Wei Hu, Yuanzhi Li

JMLR 2017 Second-Order Stochastic Optimization for Machine Learning in Linear Time Naman Agarwal, Brian Bullins, Elad Hazan

NeurIPS 2016 A Non-Generative Framework and Convex Relaxations for Unsupervised Learning Elad Hazan, Tengyu Ma

ICML 2016 Faster Convex Optimization: Simulated Annealing with an Efficient Universal Barrier Jacob Abernethy, Elad Hazan

ICML 2016 Faster Eigenvector Computation via Shift-and-Invert Preconditioning Dan Garber, Elad Hazan, Chi Jin, Sham, Cameron Musco, Praneeth Netrapalli, Aaron Sidford

MLJ 2016 Learning Rotations with Little Regret Elad Hazan, Satyen Kale, Manfred K. Warmuth

ICML 2016 On Graduated Optimization for Stochastic Non-Convex Problems Elad Hazan, Kfir Yehuda Levy, Shai Shalev-Shwartz

COLT 2016 Online Learning with Low Rank Experts Elad Hazan, Tomer Koren, Roi Livni, Yishay Mansour

NeurIPS 2016 Optimal Black-Box Reductions Between Optimization Objectives Zeyuan Allen-Zhu, Elad Hazan

NeurIPS 2016 The Limits of Learning with Missing Data Brian Bullins, Elad Hazan, Tomer Koren

ICML 2016 Variance Reduction for Faster Non-Convex Optimization Zeyuan Allen-Zhu, Elad Hazan

ICML 2016 Variance-Reduced and Projection-Free Stochastic Optimization Elad Hazan, Haipeng Luo

JMLR 2016 Volumetric Spanners: An Efficient Exploration Basis for Learning Elad Hazan, Zohar Karnin

NeurIPS 2015 Beyond Convexity: Stochastic Quasi-Convex Optimization Elad Hazan, Kfir Levy, Shai Shalev-Shwartz

ICML 2015 Classification with Low Rank and Missing Data Elad Hazan, Roi Livni, Yishay Mansour

COLT 2015 Conference on Learning Theory 2015: Preface Peter Grünwald, Elad Hazan

ICML 2015 Faster Rates for the Frank-Wolfe Method over Strongly-Convex Sets Dan Garber, Elad Hazan

NeurIPS 2015 Online Gradient Boosting Alina Beygelzimer, Elad Hazan, Satyen Kale, Haipeng Luo

NeurIPS 2015 Online Learning for Adversaries with Memory: Price of past Mistakes Oren Anava, Elad Hazan, Shie Mannor

ICML 2015 Online Learning of Eigenvectors Dan Garber, Elad Hazan, Tengyu Ma

ICML 2015 Online Time Series Prediction with Missing Data Oren Anava, Elad Hazan, Assaf Zeevi

COLT 2015 Proceedings of the 28th Conference on Learning Theory, COLT 2015, Paris, France, July 3-6, 2015 Peter Grünwald, Elad Hazan, Satyen Kale

NeurIPS 2014 Bandit Convex Optimization: Towards Tight Bounds Elad Hazan, Kfir Levy

JMLR 2014 Beyond the Regret Minimization Barrier: Optimal Algorithms for Stochastic Strongly-Convex Optimization Elad Hazan, Satyen Kale

ICML 2014 Hard-Margin Active Linear Regression Elad Hazan, Zohar Karnin

COLT 2014 Logistic Regression: Tight Bounds for Stochastic and Online Optimization Elad Hazan, Tomer Koren, Kfir Y. Levy

NeurIPS 2014 The Blinded Bandit: Learning with Adaptive Feedback Ofer Dekel, Elad Hazan, Tomer Koren

COLT 2014 Volumetric Spanners: An Efficient Exploration Basis for Learning Elad Hazan, Zohar Shay Karnin, Raghu Meka

ICML 2013 Better Rates for Any Adversarial Deterministic MDP Ofer Dekel, Elad Hazan

COLT 2013 Online Learning for Time Series Prediction Oren Anava, Elad Hazan, Shie Mannor, Ohad Shamir

COLT 2012 (weak) Calibration Is Computationally Hard Elad Hazan, Sham M. Kakade

NeurIPS 2012 A Polylog Pivot Steps Simplex Algorithm for Classification Elad Hazan, Zohar Karnin

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

COLT 2012 Near-Optimal Algorithms for Online Matrix Prediction Elad Hazan, Satyen Kale, Shai Shalev-Shwartz

JMLR 2012 Online Submodular Minimization Elad Hazan, Satyen Kale

ICML 2012 Projection-Free Online Learning Elad Hazan, Satyen Kale

COLT 2011 A Simple Multi-Armed Bandit Algorithm with Optimal Variation-Bounded Regret Elad Hazan, Satyen Kale

JMLR 2011 Adaptive Subgradient Methods for Online Learning and Stochastic Optimization John Duchi, Elad Hazan, Yoram Singer

NeurIPS 2011 Approximating Semidefinite Programs in Sublinear Time Dan Garber, Elad Hazan

NeurIPS 2011 Beating SGD: Learning SVMs in Sublinear Time Elad Hazan, Tomer Koren, Nati Srebro

JMLR 2011 Better Algorithms for Benign Bandits Elad Hazan, Satyen Kale

COLT 2011 Beyond the Regret Minimization Barrier: An Optimal Algorithm for Stochastic Strongly-Convex Optimization Elad Hazan, Satyen Kale

COLT 2011 Blackwell Approachability and No-Regret Learning Are Equivalent Jacob Abernethy, Peter L. Bartlett, Elad Hazan

NeurIPS 2011 Newtron: An Efficient Bandit Algorithm for Online Multiclass Prediction Elad Hazan, Satyen Kale

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

MLJ 2010 Extracting Certainty from Uncertainty: Regret Bounded by Variation in Costs Elad Hazan, Satyen Kale

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

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

NeurIPS 2009 Beyond Convexity: Online Submodular Minimization Elad Hazan, Satyen Kale

ICML 2009 Efficient Learning Algorithms for Changing Environments Elad Hazan, C. Seshadhri

NeurIPS 2009 On Stochastic and Worst-Case Models for Investing Elad Hazan, Satyen Kale

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

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

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

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

MLJ 2007 Logarithmic Regret Algorithms for Online Convex Optimization Elad Hazan, Amit Agarwal, Satyen Kale

COLT 2007 Online Learning with Prior Knowledge Elad Hazan, Nimrod Megiddo

ICML 2006 Algorithms for Portfolio Management Based on the Newton Method Amit Agarwal, Elad Hazan, Satyen Kale, Robert E. Schapire

COLT 2006 Logarithmic Regret Algorithms for Online Convex Optimization Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal