Elad Hazan

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Boosting simple learners	2024-07-03	Paper
Boosting simple learners	2023-11-14	Paper
Introduction to Online Convex Optimization	2023-01-25	Paper
Online learning of quantum states	2021-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4633809	2019-05-06	Paper
https://portal.mardi4nfdi.de/entity/Q4633884	2019-05-06	Paper
Revisiting the Polyak step size	2019-05-01	Paper
Adaptive Universal Linear Filtering	2018-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q4637040	2018-04-17	Paper
Learning rotations with little regret	2018-01-12	Paper
The computational power of optimization in online learning	2017-09-29	Paper
Finding approximate local minima faster than gradient descent	2017-08-17	Paper
Interior-Point Methods for Full-Information and Bandit Online Learning	2017-07-12	Paper
Near-Optimal Algorithms for Online Matrix Prediction	2017-05-30	Paper
Sublinear time algorithms for approximate semidefinite programming	2016-08-25	Paper
A linear-time algorithm for trust region problems	2016-08-25	Paper
https://portal.mardi4nfdi.de/entity/Q3188058	2016-08-16	Paper
A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization	2016-07-21	Paper
Oracle-Based Robust Optimization via Online Learning	2015-11-06	Paper
AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION	2015-04-24	Paper
An optimal algorithm for stochastic strongly-convex optimization	2014-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q5405212	2014-04-01	Paper
Sublinear optimization for machine learning	2014-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q5396673	2014-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5396640	2014-02-03	Paper
The multiplicative weights update method: a meta-algorithm and applications	2012-09-27	Paper
How Hard Is It to Approximate the Best Nash Equilibrium?	2011-05-17	Paper
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time	2010-11-04	Paper
Extracting certainty from uncertainty: regret bounded by variation in costs	2010-10-07	Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques	2010-05-26	Paper
Logarithmic regret algorithms for online convex optimization	2009-03-31	Paper
Sparse Approximate Solutions to Semidefinite Programs	2008-04-15	Paper
Online Learning with Prior Knowledge	2008-01-03	Paper
Logarithmic Regret Algorithms for Online Convex Optimization	2007-09-14	Paper
A Fast Random Sampling Algorithm for Sparsifying Matrices	2007-08-28	Paper
On the complexity of approximating $k$-set packing	2006-09-28	Paper
Research in Computational Molecular Biology	2005-11-23	Paper

Research outcomes over time

This page was built for person: Elad Hazan