( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Decomposable Non-Smooth Convex Optimization with Nearly-Linear Gradient Oracle Complexity.

, , , , и . CoRR, (2022)

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.

Keykhosrow Tat

Manutschehr Tat

Amin Tat

Sara Tat

Huschang Tat

 

Другие публикации лиц с тем же именем

Kernel-based methods for bandit convex optimization., , и . CoRR, (2016)A near-optimal algorithm for approximating the John Ellipsoid., , , и . COLT, том 99 из Proceedings of Machine Learning Research, стр. 849-873. PMLR, (2019)Optimal Algorithms for Smooth and Strongly Convex Distributed Optimization in Networks., , , , и . ICML, том 70 из Proceedings of Machine Learning Research, стр. 3027-3036. PMLR, (2017)Leverage Score Sampling for Faster Accelerated Regression and ERM, , , , , и . (2017)cite arxiv:1711.08426.Textbooks Are All You Need, , , , , , , , , и 9 other автор(ы). (2023)cite arxiv:2306.11644Comment: 26 pages.kNN-Adapter: Efficient Domain Adaptation for Black-Box Language Models., , , , и . CoRR, (2023)An Õ(m/ε3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints., и . CoRR, (2019)ReSQueing Parallel and Private Stochastic Convex Optimization., , , , , , и . FOCS, стр. 2031-2058. IEEE, (2023)An homotopy method for lp regression provably beyond self-concordance and in input-sparsity time., , , и . STOC, стр. 1130-1137. ACM, (2018)A new approach to computing maximum flows using electrical flows., , и . STOC, стр. 755-764. ACM, (2013)