default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnshumali Shrivastava
- > Home > Persons > Anshumali Shrivastava
Publications
- 2023
[c83]Nicholas Meisburger, Vihan Lakshman
, Benito Geordie, Joshua Engels, David Torres Ramos, Pratik Pranav, Benjamin Coleman, Benjamin Meisburger, Shubh Gupta, Yashwanth Adunukota, Siddharth Jain, Tharun Medini, Anshumali Shrivastava:
BOLT: An Automated Deep Learning Framework for Training and Deploying Large-Scale Search and Recommendation Models on Commodity CPU Hardware. CIKM 2023: 4738-4744- [c76]Anshumali Shrivastava, Vihan Lakshman, Tharun Medini, Nicholas Meisburger, Joshua Engels, David Torres Ramos, Benito Geordie, Pratik Pranav, Shubh Gupta, Yashwanth Adunukota, Siddharth Jain:
From Research to Production: Towards Scalable and Sustainable Neural Recommendation Models on Commodity CPU Hardware. RecSys 2023: 1071-1074 - [i94]Nicholas Meisburger, Vihan Lakshman, Benito Geordie, Joshua Engels, David Torres Ramos, Pratik Pranav, Benjamin Coleman, Benjamin Meisburger, Shubh Gupta, Yashwanth Adunukota, Tharun Medini, Anshumali Shrivastava:
BOLT: An Automated Deep Learning Framework for Training and Deploying Large-Scale Neural Networks on Commodity CPU Hardware. CoRR abs/2303.17727 (2023) - 2022
- [c74]Tianyi Zhang, Zhaozhuo Xu, Tharun Medini, Anshumali Shrivastava:
Structural Contrastive Representation Learning for Zero-shot Multi-label Text Classification. EMNLP (Findings) 2022: 4937-4947 - [c70]Gaurav Gupta, Tharun Medini, Anshumali Shrivastava, Alexander J. Smola:
BLISS: A Billion scale Index using Iterative Re-partitioning. KDD 2022: 486-495 - [i81]Minghao Yan, Nicholas Meisburger, Tharun Medini, Anshumali Shrivastava:
Distributed SLIDE: Enabling Training Large Neural Networks on Low Bandwidth and Simple CPU-Clusters via Model Parallelism and Sparsity. CoRR abs/2201.12667 (2022) - 2021
- [c58]Tharun Medini, Beidi Chen, Anshumali Shrivastava:
SOLAR: Sparse Orthogonal Learned and Random Embeddings. ICLR 2021 - [c57]Shabnam Daghaghi, Tharun Medini, Nicholas Meisburger, Beidi Chen, Mengnan Zhao, Anshumali Shrivastava:
A Tale of Two Efficient and Informative Negative Sampling Distributions. ICML 2021: 2319-2329 - [c48]Gaurav Gupta, Minghao Yan, Benjamin Coleman, Bryce Kille, Ryan A. Leo Elworth, Tharun Medini, Todd J. Treangen, Anshumali Shrivastava:
Fast Processing and Querying of 170TB of Genomics Data via a Repeated And Merged BloOm Filter (RAMBO). SIGMOD Conference 2021: 2226-2234 - [c47]Shabnam Daghaghi, Tharun Medini, Anshumali Shrivastava:
SDM-Net: A simple and effective model for generalized zero-shot learning. UAI 2021: 2103-2113 - [i71]Gaurav Gupta, Tharun Medini, Anshumali Shrivastava, Alexander J. Smola:
IRLI: Iterative Re-partitioning for Learning to Index. CoRR abs/2103.09944 (2021) - 2020
- [c42]Beidi Chen, Tharun Medini, James Farwell, Sameh Gobriel, Tsung-Yuan Charlie Tai, Anshumali Shrivastava:
SLIDE : In Defense of Smart Algorithms over Hardware Acceleration for Large-Scale Deep Learning Systems. MLSys 2020 - [i53]Tharun Medini, Beidi Chen, Anshumali Shrivastava:
SOLAR: Sparse Orthogonal Learned and Random Embeddings. CoRR abs/2008.13225 (2020) - [i49]Shabnam Daghaghi, Tharun Medini, Beidi Chen, Mengnan Zhao, Anshumali Shrivastava:
A Constant-time Adaptive Negative Sampling. CoRR abs/2012.15843 (2020) - 2019
- [c35]Tharun Medini, Qixuan Huang, Yiqiu Wang, Vijai Mohan, Anshumali Shrivastava:
Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products. NeurIPS 2019: 13244-13254 - [i48]Shabnam Daghaghi, Anshumali Shrivastava, Tharun Medini:
Cross-Modal Mapping for Generalized Zero-Shot Learning by Soft-Labeling. ViGIL@NeurIPS 2019 - [i44]Beidi Chen, Tharun Medini, Anshumali Shrivastava:
SLIDE : In Defense of Smart Algorithms over Hardware Acceleration for Large-Scale Deep Learning Systems. CoRR abs/1903.03129 (2019) - [i41]Shabnam Daghaghi, Tharun Medini, Anshumali Shrivastava:
Semantic Similarity Based Softmax Classifier for Zero-Shot Learning. CoRR abs/1909.04790 (2019) - [i40]Gaurav Gupta, Benjamin Coleman, Tharun Medini, Vijai Mohan, Anshumali Shrivastava:
RAMBO: Repeated And Merged Bloom Filter for Multiple Set Membership Testing (MSMT) in Sub-linear time. CoRR abs/1910.02611 (2019) - [i39]Gaurav Gupta, Minghao Yan, Benjamin Coleman, Bryce Kille, Ryan A. Leo Elworth, Tharun Medini, Todd J. Treangen, Anshumali Shrivastava:
Fast Processing and Querying of 170TB of Genomics Data via a Repeated And Merged BloOm Filter (RAMBO). CoRR abs/1910.04358 (2019) - [i37]Tharun Medini, Qixuan Huang, Yiqiu Wang, Vijai Mohan, Anshumali Shrivastava:
Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products. CoRR abs/1910.13830 (2019) - 2018
- [i28]Qixuan Huang, Yiqiu Wang, Tharun Medini, Anshumali Shrivastava:
Extreme Classification in Log Memory. CoRR abs/1810.04254 (2018)
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2025-08-15 01:31 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 was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
