( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Exponential Learning Rate Schedule for Deep Learning

, и . (2019)cite arxiv:1910.07454Comment: 27 pages, 15 figures.

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.

Sachin Arora

Sanjeev Kumar

Sanjeev Sarpal

Deepak Arora

Deepika Arora

 

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

A randomized online algorithm for bandwidth utilization., и . SODA, стр. 535-539. ACM/SIAM, (2002)Improved Algorithms for Unique Games via Divide and Conquer., , , и . Electron. Colloquium Comput. Complex., (2010)On the Optimization of Deep Networks: Implicit Acceleration by Overparameterization., , и . ICML, том 80 из Proceedings of Machine Learning Research, стр. 244-253. PMLR, (2018)Semidefinite Programming and Approximation Algorithms: A Survey.. SWAT, том 6139 из Lecture Notes in Computer Science, стр. 25. Springer, (2010)Exploring complexity through reductions.. Computational Complexity Theory, том 10 из IAS / Park City mathematics series, AMS Chelsea Publishing, (2004)A Compressed Sensing View of Unsupervised Text Embeddings, Bag-of-n-Grams, and LSTMs., , , и . ICLR (Poster), OpenReview.net, (2018)Unique games on expanding constraint graphs are easy: extended abstract., , , , , и . STOC, стр. 21-28. ACM, (2008)A combinatorial, primal-dual approach to semidefinite programs., и . STOC, стр. 227-236. ACM, (2007)Towards a Study of Low-Complexity Graphs., , и . ICALP (1), том 5555 из Lecture Notes in Computer Science, стр. 119-131. Springer, (2009)Unlearning via Sparse Representations., , , , , , , и . CoRR, (2023)