| Publication | Date of Publication | Type |
|---|
Boosting simple learners
TheoretiCS | 2024-07-03 | Paper |
Boosting simple learners
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Introduction to Online Convex Optimization
(available as arXiv preprint) | 2023-01-25 | Paper |
Online learning of quantum states
Journal of Statistical Mechanics: Theory and Experiment | 2021-03-16 | Paper |
| Better algorithms for benign bandits | 2019-05-06 | Paper |
| How hard is it to approximate the best Nash equilibrium? | 2019-05-06 | Paper |
| Revisiting the Polyak step size | 2019-05-01 | Paper |
Adaptive Universal Linear Filtering
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
| Second-order stochastic optimization for machine learning in linear time | 2018-04-17 | Paper |
Second-order stochastic optimization for machine learning in linear time
(available as arXiv preprint) | 2018-04-17 | Paper |
Learning rotations with little regret
Machine Learning | 2018-01-12 | Paper |
The computational power of optimization in online learning
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Finding approximate local minima faster than gradient descent
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Interior-Point Methods for Full-Information and Bandit Online Learning
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Near-optimal algorithms for online matrix prediction
SIAM Journal on Computing | 2017-05-30 | Paper |
Sublinear time algorithms for approximate semidefinite programming
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
A linear-time algorithm for trust region problems
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
| Volumetric spanners: an efficient exploration basis for learning | 2016-08-16 | Paper |
A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization
SIAM Journal on Optimization | 2016-07-21 | Paper |
Oracle-based robust optimization via online learning
Operations Research | 2015-11-06 | Paper |
AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION
Mathematical Finance | 2015-04-24 | Paper |
| Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization | 2014-12-08 | Paper |
Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
(available as arXiv preprint) | 2014-12-08 | Paper |
| Online submodular minimization | 2014-04-01 | Paper |
Sublinear optimization for machine learning
Journal of the ACM | 2014-02-17 | Paper |
| Adaptive subgradient methods for online learning and stochastic optimization | 2014-02-03 | Paper |
| scientific article; zbMATH DE number 6253908 (Why is no real title available?) | 2014-02-03 | Paper |
The multiplicative weights update method: a meta-algorithm and applications
Theory of Computing | 2012-09-27 | Paper |
How Hard Is It to Approximate the Best Nash Equilibrium?
SIAM Journal on Computing | 2011-05-17 | Paper |
\(O(\sqrt{\log n})\) approximation to sparsest cut in \(\tilde{O}(n^2)\) time
SIAM Journal on Computing | 2010-11-04 | Paper |
Extracting certainty from uncertainty: regret bounded by variation in costs
Machine Learning | 2010-10-07 | Paper |
On the complexity of approximating \(k\)-dimensional matching
Lecture Notes in Computer Science | 2010-05-26 | Paper |
Logarithmic regret algorithms for online convex optimization
Machine Learning | 2009-03-31 | Paper |
Sparse Approximate Solutions to Semidefinite Programs
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Online Learning with Prior Knowledge
Learning Theory | 2008-01-03 | Paper |
Logarithmic Regret Algorithms for Online Convex Optimization
Learning Theory | 2007-09-14 | Paper |
A Fast Random Sampling Algorithm for Sparsifying Matrices
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
On the complexity of approximating \(k\)-set packing
Computational Complexity | 2006-09-28 | Paper |
Research in Computational Molecular Biology
Lecture Notes in Computer Science | 2005-11-23 | Paper |
