( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Differentially Private Fine-tuning of Language Models.

, , , , , , , , , , , и . CoRR, (2021)

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.

No persons found for author name Backurs, Arturs
add a person with the name Backurs, Arturs
 

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

On the sum of L1 influences., и . Electron. Colloquium Comput. Complex., (2013)Optimal quantum query bounds for almost all Boolean functions., , , и . STACS, том 20 из LIPIcs, стр. 446-453. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Impossibility Results for Grammar-Compressed Linear Algebra., , , и . NeurIPS, (2020)Faster Kernel Matrix Algebra via Density Estimation., , , и . ICML, том 139 из Proceedings of Machine Learning Research, стр. 500-510. PMLR, (2021)Efficient Density Evaluation for Smooth Kernels., , , и . FOCS, стр. 615-626. IEEE Computer Society, (2018)If the Current Clique Algorithms are Optimal, So is Valiant's Parser., , и . FOCS, стр. 98-117. IEEE Computer Society, (2015)Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)., и . SIAM J. Comput., 47 (3): 1087-1097 (2018)Search by quantum walks on two-dimensional grid without amplitude amplification, , , , и . CoRR, (2011)Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)., и . CoRR, (2014)Scalable Fair Clustering., , , , , и . ICML, том 97 из Proceedings of Machine Learning Research, стр. 405-413. PMLR, (2019)