Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDShashank Rajput
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[i10]Shashank Rajput, Kangwook Lee, Dimitris S. Papailiopoulos:
Permutation-Based SGD: Is Random Optimal? CoRR abs/2102.09718 (2021)- [i9]Shashank Rajput, Kartik Sreenivasan, Dimitris S. Papailiopoulos, Amin Karbasi:
An Exponential Improvement on the Memorization Capacity of Deep Threshold Networks. CoRR abs/2106.07724 (2021) - [i8]Kartik Sreenivasan, Shashank Rajput, Jy-yong Sohn, Dimitris S. Papailiopoulos:
Finding Everything within Random Binary Networks. CoRR abs/2110.08996 (2021) - [i7]Chulhee Yun, Shashank Rajput, Suvrit Sra:
Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond. CoRR abs/2110.10342 (2021) - 2020
- [c5]Shashank Rajput, Anant Gupta, Dimitris S. Papailiopoulos:
Closing the convergence gap of SGD without replacement. ICML 2020: 7964-7973 - [c4]Ankit Pensia, Shashank Rajput, Alliot Nagle, Harit Vishwakarma, Dimitris S. Papailiopoulos:
Optimal Lottery Tickets via Subset Sum: Logarithmic Over-Parameterization is Sufficient. NeurIPS 2020 - [c3]Hongyi Wang, Kartik Sreenivasan, Shashank Rajput, Harit Vishwakarma, Saurabh Agarwal, Jy-yong Sohn, Kangwook Lee, Dimitris S. Papailiopoulos:
Attack of the Tails: Yes, You Really Can Backdoor Federated Learning. NeurIPS 2020 - [i6]Shashank Rajput, Anant Gupta, Dimitris S. Papailiopoulos:
Closing the convergence gap of SGD without replacement. CoRR abs/2002.10400 (2020) - [i5]Ankit Pensia, Shashank Rajput, Alliot Nagle, Harit Vishwakarma, Dimitris S. Papailiopoulos:
Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficient. CoRR abs/2006.07990 (2020) - [i4]Hongyi Wang, Kartik Sreenivasan, Shashank Rajput, Harit Vishwakarma, Saurabh Agarwal, Jy-yong Sohn, Kangwook Lee, Dimitris S. Papailiopoulos:
Attack of the Tails: Yes, You Really Can Backdoor Federated Learning. CoRR abs/2007.05084 (2020)
2010 – 2019
- 2019
- [c2]Shashank Rajput, Zhili Feng, Zachary B. Charles, Po-Ling Loh, Dimitris S. Papailiopoulos:
Does Data Augmentation Lead to Positive Margin? ICML 2019: 5321-5330 - [c1]Shashank Rajput, Hongyi Wang, Zachary B. Charles, Dimitris S. Papailiopoulos:
DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregation. NeurIPS 2019: 10320-10330 - [i3]Shashank Rajput, Zhili Feng, Zachary B. Charles, Po-Ling Loh, Dimitris S. Papailiopoulos:
Does Data Augmentation Lead to Positive Margin? CoRR abs/1905.03177 (2019) - [i2]Zachary B. Charles, Shashank Rajput, Stephen J. Wright, Dimitris S. Papailiopoulos:
Convergence and Margin of Adversarial Training on Separable Data. CoRR abs/1905.09209 (2019) - [i1]Shashank Rajput, Hongyi Wang, Zachary B. Charles, Dimitris S. Papailiopoulos:
DETOX: A Redundancy-based Framework for Faster and More Robust Gradient Aggregation. CoRR abs/1907.12205 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-10-30 03:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
