Author of the publication

Sparsity, variance and curvature in multi-armed bandits.

, , and . ALT, volume 83 of Proceedings of Machine Learning Research, page 111-127. PMLR, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities.. SODA, page 278-287. SIAM, (2016)Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations., , , , , , and . FOCS, page 898-909. IEEE Computer Society, (2018)Sparsity, variance and curvature in multi-armed bandits., , and . CoRR, (2017)Sparsity, variance and curvature in multi-armed bandits., , and . ALT, volume 83 of Proceedings of Machine Learning Research, page 111-127. PMLR, (2018)An homotopy method for lp regression provably beyond self-concordance and in input-sparsity time., , , and . STOC, page 1130-1137. ACM, (2018)A near-optimal algorithm for approximating the John Ellipsoid., , , and . COLT, volume 99 of Proceedings of Machine Learning Research, page 849-873. PMLR, (2019)Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration., , and . ITCS, volume 185 of LIPIcs, page 62:1-62:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Solving SDD linear systems in nearly mlog1/2n time., , , , , , and . STOC, page 343-352. ACM, (2014)Lp Row Sampling by Lewis Weights., and . STOC, page 183-192. ACM, (2015)Online Row Sampling., , and . APPROX-RANDOM, volume 60 of LIPIcs, page 7:1-7:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)