Elad Hazan

From MaRDI portal
Person:304245

Available identifiers

zbMath Open hazan.eladMaRDI QIDQ304245

List of research outcomes





PublicationDate of PublicationType
Boosting simple learners2024-07-03Paper
Boosting simple learners2023-11-14Paper
Introduction to Online Convex Optimization2023-01-25Paper
Online learning of quantum states2021-03-16Paper
https://portal.mardi4nfdi.de/entity/Q46338092019-05-06Paper
https://portal.mardi4nfdi.de/entity/Q46338842019-05-06Paper
Revisiting the Polyak step size2019-05-01Paper
Adaptive Universal Linear Filtering2018-08-22Paper
https://portal.mardi4nfdi.de/entity/Q46370402018-04-17Paper
Learning rotations with little regret2018-01-12Paper
The computational power of optimization in online learning2017-09-29Paper
Finding approximate local minima faster than gradient descent2017-08-17Paper
Interior-Point Methods for Full-Information and Bandit Online Learning2017-07-12Paper
Near-Optimal Algorithms for Online Matrix Prediction2017-05-30Paper
Sublinear time algorithms for approximate semidefinite programming2016-08-25Paper
A linear-time algorithm for trust region problems2016-08-25Paper
https://portal.mardi4nfdi.de/entity/Q31880582016-08-16Paper
A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization2016-07-21Paper
Oracle-Based Robust Optimization via Online Learning2015-11-06Paper
AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION2015-04-24Paper
An optimal algorithm for stochastic strongly-convex optimization2014-12-08Paper
https://portal.mardi4nfdi.de/entity/Q54052122014-04-01Paper
Sublinear optimization for machine learning2014-02-17Paper
https://portal.mardi4nfdi.de/entity/Q53966732014-02-03Paper
https://portal.mardi4nfdi.de/entity/Q53966402014-02-03Paper
The multiplicative weights update method: a meta-algorithm and applications2012-09-27Paper
How Hard Is It to Approximate the Best Nash Equilibrium?2011-05-17Paper
$O(\sqrt{\logn})$ Approximation to SPARSEST CUT in $\tilde{O}(n^2)$ Time2010-11-04Paper
Extracting certainty from uncertainty: regret bounded by variation in costs2010-10-07Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques2010-05-26Paper
Logarithmic regret algorithms for online convex optimization2009-03-31Paper
Sparse Approximate Solutions to Semidefinite Programs2008-04-15Paper
Online Learning with Prior Knowledge2008-01-03Paper
Logarithmic Regret Algorithms for Online Convex Optimization2007-09-14Paper
A Fast Random Sampling Algorithm for Sparsifying Matrices2007-08-28Paper
On the complexity of approximating \(k\)-set packing2006-09-28Paper
Research in Computational Molecular Biology2005-11-23Paper

Research outcomes over time

This page was built for person: Elad Hazan