Logarithmic regret algorithms for online convex optimization von HAZAN, Elad, AGARWAL, Amit, KALE, Satyen

Volltext

Sublinear time algorithms for approximate semidefinite programming von Garber, Dan, Hazan, Elad

Volltext

Oracle-Based Robust Optimization via Online Learning von Ben-Tal, Aharon, Hazan, Elad, Koren, Tomer, Mannor, Shie

Volltext

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

Volltext

Boosting Simple Learners von Alon, Noga, Gonen, Alon, Hazan, Elad, Moran, Shay

Volltext

Introduction to Online Convex Optimization von Hazan, Elad

Volltext

A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization von Garber, Dan, Hazan, Elad

Volltext

Adaptive Online Learning of Quantum States von Chen, Xinyi, Hazan, Elad, Li, Tongyang, Lu, Zhou, Wang, Xinzhao, Yang, Rui

Volltext

On the complexity of approximating k-set packing von Hazan, Elad, Safra, Shmuel, Schwartz, Oded

Volltext

A linear-time algorithm for trust region problems von Hazan, Elad, Koren, Tomer

Volltext

Extracting certainty from uncertainty: regret bounded by variation in costs von Hazan, Elad, Kale, Satyen

Volltext

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

Volltext

Sparse Approximate Solutions to Semidefinite Programs von Hazan, Elad

Volltext

HOW HARD IS IT TO APPROXIMATE THE BEST NASH EQUILIBRIUM? von HAZAN, Elad, KRAUTHGAMER, Robert

Volltext

AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION von Hazan, Elad, Kale, Satyen

Volltext

Online learning of quantum states von Aaronson, Scott, Chen, Xinyi, Hazan, Elad, Kale, Satyen, Nayak, Ashwin

Volltext

Sublinear Optimization for Machine Learning von CLARKSON, Kenneth L, HAZAN, Elad, WOODRUFF, David P

Volltext

Interior-Point Methods for Full-Information and Bandit Online Learning von Abernethy, Jacob D., Hazan, Elad, Rakhlin, Alexander

Volltext

O(√log n) APPROXIMATION TO SPARSEST CUT IN Õ(n2) TIME von ARORA, Sanjeev, HAZAN, Elad, KALE, Satyen

Volltext

Learning rotations with little regret von Hazan, Elad, Kale, Satyen, Warmuth, Manfred K.

Volltext