Author of the publication

Efficient Full-Matrix Adaptive Regularization.

, , , , , , and . ICML, volume 97 of Proceedings of Machine Learning Research, page 102-110. PMLR, (2019)

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

Blackwell Approachability and Low-Regret Learning are Equivalent, , and . CoRR, (2010)Introduction to Online Convex Optimization. Foundations and Trends in Optimization Now, Boston, (2017)Almost Optimal Sublinear Time Algorithm for Semidefinite Programming, and . CoRR, (2012)A linear-time algorithm for trust region problems., and . Math. Program., 158 (1-2): 363-381 (2016)Lecture Notes: Optimization for Machine Learning. (2019)cite arxiv:1909.03550.The Nonstochastic Control Problem., , and . ALT, volume 117 of Proceedings of Machine Learning Research, page 408-421. PMLR, (2020)Extreme Tensoring for Low-Memory Preconditioning., , , , and . ICLR, OpenReview.net, (2020)Projection-free Online Learning., and . ICML, icml.cc / Omnipress, (2012)Lower Bounds for Higher-Order Convex Optimization., and . COLT, volume 75 of Proceedings of Machine Learning Research, page 774-792. PMLR, (2018)On the Complexity of Approximating k-Dimensional Matching., , and . RANDOM-APPROX, volume 2764 of Lecture Notes in Computer Science, page 83-97. Springer, (2003)