| Publication | Date of Publication | Type |
|---|
Private Matrix Approximation and Geometry of Unitary Orbits
| 2022-07-06 | Paper |
Online learning of quantum states
Journal of Statistical Mechanics: Theory and Experiment | 2021-03-16 | Paper |
scientific article; zbMATH DE number 7051290 (Why is no real title available?)
| 2019-05-06 | Paper |
Better algorithms for benign bandits
| 2019-05-06 | Paper |
A combinatorial, primal-dual approach to semidefinite programs
Journal of the ACM | 2018-08-02 | Paper |
Learning rotations with little regret
Machine Learning | 2018-01-12 | Paper |
Online Semidefinite Programming.
| 2017-12-19 | Paper |
Near-optimal algorithms for online matrix prediction
SIAM Journal on Computing | 2017-05-30 | Paper |
AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION
Mathematical Finance | 2015-04-24 | Paper |
Efficient aggregation algorithms for probabilistic data
| 2014-12-18 | Paper |
Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
| 2014-12-08 | Paper |
Online submodular minimization
| 2014-04-01 | Paper |
scientific article; zbMATH DE number 6253908 (Why is no real title available?)
| 2014-02-03 | Paper |
The Approximability of the Binary Paintshop Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Noise tolerance of expanders and sublinear expansion reconstruction
SIAM Journal on Computing | 2013-07-04 | Paper |
The multiplicative weights update method: a meta-algorithm and applications
Theory of Computing | 2012-09-27 | Paper |
An expansion tester for bounded degree graphs
SIAM Journal on Computing | 2011-10-18 | 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 |
Logarithmic regret algorithms for online convex optimization
Machine Learning | 2009-03-31 | Paper |
scientific article; zbMATH DE number 5485455 (Why is no real title available?)
| 2009-01-05 | Paper |
An Expansion Tester for Bounded Degree Graphs
Automata, Languages and Programming | 2008-08-28 | 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 |
