( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Leverage Score Sampling for Faster Accelerated Regression and ERM.

, , , , , и . ALT, том 117 из Proceedings of Machine Learning Research, стр. 22-47. PMLR, (2020)

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.

Vijayendran Koombil Kummaya Praneeth

 

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

Making the Last Iterate of SGD Information Theoretically Optimal., , и . COLT, том 99 из Proceedings of Machine Learning Research, стр. 1752-1755. PMLR, (2019)Learning the graph of epidemic cascades., и . SIGMETRICS, стр. 211-222. ACM, (2012)Online Non-Convex Learning: Following the Perturbed Leader is Optimal., и . CoRR, (2019)Simplicity Bias in 1-Hidden Layer Neural Networks., , , и . CoRR, (2023)P-SIF: Document Embeddings Using Partition Averaging., , , , , и . AAAI, стр. 7863-7870. AAAI Press, (2020)Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness., , , и . NeurIPS, стр. 29874-29884. (2021)Near-optimal Offline and Streaming Algorithms for Learning Non-Linear Dynamical Systems., , , и . NeurIPS, стр. 8518-8531. (2021)Focus on the Common Good: Group Distributional Robustness Follows., , и . ICLR, OpenReview.net, (2022)What is Local Optimality in Nonconvex-Nonconcave Minimax Optimization?, , и . ICML, том 119 из Proceedings of Machine Learning Research, стр. 4880-4889. PMLR, (2020)No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization., , , и . ITCS, том 185 из LIPIcs, стр. 53:1-53:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)