Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDAnshumali Shrivastava
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[c46]Anastasios Kyrillidis, Anshumali Shrivastava, Moshe Y. Vardi, Zhiwei Zhang:
FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints. AAAI 2020: 1552-1560- [c45]Beidi Chen, Weiyang Liu, Zhiding Yu, Jan Kautz, Anshumali Shrivastava, Animesh Garg, Animashree Anandkumar:
Angular Visual Hardness. ICML 2020: 1637-1648 - [c44]Benjamin Coleman, Richard G. Baraniuk, Anshumali Shrivastava:
Sub-linear Memory Sketches for Near Neighbor Search on Streaming Data. ICML 2020: 2089-2099 - [c43]Ryan Spring, Anshumali Shrivastava:
Mutual Information Estimation using LSH Sampling. IJCAI 2020: 2807-2815 - [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 - [c41]Zhenwei Dai, Anshumali Shrivastava:
Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier with Application to Real-Time Information Filtering on the Web. NeurIPS 2020 - [c40]Benjamin Coleman, Anshumali Shrivastava:
Sub-linear RACE Sketches for Approximate Kernel Density Estimation on Streaming Data. WWW 2020: 1739-1749 - [i58]Sicong Liu, Junzhao Du, Anshumali Shrivastava, Lin Zhong:
Privacy Adversarial Network: Representation Learning for Mobile Data Privacy. CoRR abs/2006.06535 (2020) - [i57]Benjamin Coleman, Anshumali Shrivastava:
A One-Pass Private Sketch for Most Machine Learning Tasks. CoRR abs/2006.09352 (2020) - [i56]Benjamin Coleman, Gaurav Gupta, John Chen, Anshumali Shrivastava:
STORM: Foundations of End-to-End Empirical Risk Minimization on the Edge. CoRR abs/2006.14554 (2020) - [i55]Zichang Liu, Zhaozhuo Xu, Alan Ji, Jonathan Li, Beidi Chen, Anshumali Shrivastava:
Climbing the WOL: Training for Cheaper Inference. CoRR abs/2007.01230 (2020) - [i54]Louis Abraham, Gary Bécigneul, Benjamin Coleman, Bernhard Schölkopf, Anshumali Shrivastava, Alexander J. Smola:
Bloom Origami Assays: Practical Group Testing. CoRR abs/2008.02641 (2020) - [i53]Nicholas Meisburger, Anshumali Shrivastava:
Distributed Tera-Scale Similarity Search with MPI: Provably Efficient Similarity Search over billions without a Single Distance Computation. CoRR abs/2008.03260 (2020) - [i52]Tharun Medini, Beidi Chen, Anshumali Shrivastava:
SOLAR: Sparse Orthogonal Learned and Random Embeddings. CoRR abs/2008.13225 (2020) - [i51]Constantinos Chamzas, Zachary K. Kingston, Carlos Quintero-Peña, Anshumali Shrivastava, Lydia E. Kavraki:
Learning Sampling Distributions Using Local 3D Workspace Decompositions for Motion Planning in High Dimensions. CoRR abs/2010.15335 (2020) - [i50]Zhenwei Dai, Aditya Desai, Reinhard Heckel, Anshumali Shrivastava:
Active Sampling Count Sketch (ASCS) for Online Sparse Estimation of a Trillion Scale Covariance Matrix. CoRR abs/2010.15951 (2020) - [i49]Zichang Liu, Li Chou, Anshumali Shrivastava:
Neighbor Oblivious Learning (NObLe) for Device Localization and Tracking. CoRR abs/2011.14954 (2020) - [i48]Shabnam Daghaghi, Tharun Medini, Beidi Chen, Mengnan Zhao, Anshumali Shrivastava:
A Constant-time Adaptive Negative Sampling. CoRR abs/2012.15843 (2020)
2010 – 2019
- 2019
- [j2]Sicong Liu, Junzhao Du, Anshumali Shrivastava, Lin Zhong:
Privacy Adversarial Network: Representation Learning for Mobile Data Privacy. Proc. ACM Interact. Mob. Wearable Ubiquitous Technol. 3(4): 144:1-144:18 (2019) - [j1]Andrew M. Wells
, Neil T. Dantam, Anshumali Shrivastava, Lydia E. Kavraki:
Learning Feasibility for Task and Motion Planning in Tabletop Environments. IEEE Robotics Autom. Lett. 4(2): 1255-1262 (2019) - [c39]Chen Luo, Anshumali Shrivastava:
Scaling-Up Split-Merge MCMC with Locality Sensitive Sampling (LSS). AAAI 2019: 4464-4471 - [c38]Ryan Spring, Anastasios Kyrillidis, Vijai Mohan, Anshumali Shrivastava:
Compressing Gradient Optimizers via Count-Sketches. ICML 2019: 5946-5955 - [c37]Constantinos Chamzas, Anshumali Shrivastava, Lydia E. Kavraki:
Using Local Experiences for Global Motion Planning. ICRA 2019: 8606-8612 - [c36]Beidi Chen, Yingchen Xu, Anshumali Shrivastava:
Fast and Accurate Stochastic Gradient Estimation. NeurIPS 2019: 12339-12349 - [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 - [i47]Shabnam Daghaghi, Anshumali Shrivastava, Tharun Medini:
Cross-Modal Mapping for Generalized Zero-Shot Learning by Soft-Labeling. ViGIL@NeurIPS 2019 - [i46]Sicong Liu, Anshumali Shrivastava, Junzhao Du, Lin Zhong:
Better accuracy with quantified privacy: representations learned via reconstructive adversarial network. CoRR abs/1901.08730 (2019) - [i45]Ryan Spring, Anastasios Kyrillidis, Vijai Mohan, Anshumali Shrivastava:
Compressing Gradient Optimizers via Count-Sketches. CoRR abs/1902.00179 (2019) - [i44]Benjamin Coleman, Anshumali Shrivastava, Richard G. Baraniuk:
RACE: Sub-Linear Memory Sketches for Approximate Near-Neighbor Search on Streaming Data. CoRR abs/1902.06687 (2019) - [i43]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) - [i42]Constantinos Chamzas, Anshumali Shrivastava, Lydia E. Kavraki:
Using Local Experiences for Global Motion Planning. CoRR abs/1903.08693 (2019) - [i41]John Chen, Benjamin Coleman, Anshumali Shrivastava:
Revisiting Consistent Hashing with Bounded Loads. CoRR abs/1908.08762 (2019) - [i40]Shabnam Daghaghi, Tharun Medini, Anshumali Shrivastava:
Semantic Similarity Based Softmax Classifier for Zero-Shot Learning. CoRR abs/1909.04790 (2019) - [i39]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) - [i38]Zhenwei Dai, Anshumali Shrivastava:
Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier. CoRR abs/1910.09131 (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) - [i36]Beidi Chen, Yingchen Xu, Anshumali Shrivastava:
Lsh-sampling Breaks the Computation Chicken-and-egg Loop in Adaptive Stochastic Gradient Estimation. CoRR abs/1910.14162 (2019) - [i35]Anastasios Kyrillidis, Anshumali Shrivastava, Moshe Y. Vardi, Zhiwei Zhang:
FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints. CoRR abs/1912.01032 (2019) - [i34]Beidi Chen, Weiyang Liu, Animesh Garg, Zhiding Yu, Anshumali Shrivastava, Jan Kautz, Anima Anandkumar:
Angular Visual Hardness. CoRR abs/1912.02279 (2019) - [i33]Benjamin Coleman, Anshumali Shrivastava:
Sub-linear RACE Sketches for Approximate Kernel Density Estimation on Streaming Data. CoRR abs/1912.02283 (2019) - [i32]M. Sadegh Riazi, Beidi Chen, Anshumali Shrivastava, Dan S. Wallach, Farinaz Koushanfar:
Sub-Linear Privacy-Preserving Near-Neighbor Search. IACR Cryptol. ePrint Arch. 2019: 1222 (2019) - 2018
- [c34]Chen Luo, Anshumali Shrivastava:
Jaccard Affiliation Graph (JAG) Model For Explaining Overlapping Community Behaviors. ASONAM 2018: 1-8 - [c33]Beidi Chen, Yingchen Xu, Anshumali Shrivastava:
Lsh-Sampling breaks the Computational chicken-and-egg Loop in adaptive stochastic Gradient estimation. ICLR (Workshop) 2018 - [c32]Ryan Spring, Anshumali Shrivastava:
Scalable Estimation via LSH Samplers (LSS). ICLR (Workshop) 2018 - [c31]Amirali Aghazadeh, Ryan Spring, Daniel LeJeune, Gautam Dasarathy, Anshumali Shrivastava, Richard G. Baraniuk:
MISSION: Ultra Large-Scale Feature Selection using Count-Sketches. ICML 2018: 80-88 - [c30]Chen Luo, Zhengzhang Chen, Lu-An Tang, Anshumali Shrivastava, Zhichun Li, Haifeng Chen, Jieping Ye:
TINET: Learning Invariant Networks via Knowledge Transfer. KDD 2018: 1890-1899 - [c29]Ankush Mandal, He Jiang, Anshumali Shrivastava, Vivek Sarkar:
Topkapi: Parallel and Fast Sketches for Finding Top-K Frequent Elements. NeurIPS 2018: 10921-10931 - [c28]Rebecca C. Steorts, Anshumali Shrivastava:
Probabilistic Blocking with an Application to the Syrian Conflict. PSD 2018: 314-327 - [c27]Yiqiu Wang, Anshumali Shrivastava, Jonathan Wang, Junghee Ryu:
Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search. SIGMOD Conference 2018: 889-903 - [c26]Beidi Chen, Anshumali Shrivastava:
Densified Winner Take All (WTA) Hashing for Sparse Datasets. UAI 2018: 906-916 - [c25]Chen Luo, Anshumali Shrivastava:
Arrays of (locality-sensitive) Count Estimators (ACE): Anomaly Detection on the Edge. WWW 2018: 1439-1448 - [c24]Anshumali Shrivastava:
Training 100, 000 Classes on a Single Titan X in 7 Hours or 15 Minutes with 25 Titan Xs. WWW (Companion Volume) 2018: 1895 - [i31]Chen Luo, Anshumali Shrivastava:
Scaling-up Split-Merge MCMC with Locality Sensitive Sampling (LSS). CoRR abs/1802.07444 (2018) - [i30]Amirali Aghazadeh, Ryan Spring, Daniel LeJeune, Gautam Dasarathy, Anshumali Shrivastava, Richard G. Baraniuk:
MISSION: Ultra Large-Scale Feature Selection using Count-Sketches. CoRR abs/1806.04310 (2018) - [i29]Chen Luo, Anshumali Shrivastava:
Want to bring a community together? Create more sub-communities. CoRR abs/1807.04911 (2018) - [i28]Qixuan Huang, Yiqiu Wang, Tharun Medini, Anshumali Shrivastava:
Extreme Classification in Log Memory. CoRR abs/1810.04254 (2018) - [i27]Rebecca C. Steorts, Anshumali Shrivastava:
Probabilistic Blocking with An Application to the Syrian Conflict. CoRR abs/1810.05497 (2018) - 2017
- [c23]E. J. Jose Gonzalez, Chen Luo, Anshumali Shrivastava, Krishna V. Palem, Yongshik Moon, Soonhyun Noh, Daedong Park, Seongsoo Hong:
Location detection for navigation using IMUs with a map through coarse-grained machine learning. DATE 2017: 500-505 - [c22]Anshumali Shrivastava:
Optimal Densification for Fast and Accurate Minwise Hashing. ICML 2017: 3154-3163 - [c21]Amirali Aghazadeh, Andrew S. Lan, Anshumali Shrivastava, Richard G. Baraniuk:
RHash: Robust Hashing via L_infinity-norm Distortion. IJCAI 2017: 1386-1394 - [c20]Ryan Spring, Anshumali Shrivastava:
Scalable and Sustainable Deep Learning via Randomized Hashing. KDD 2017: 445-454 - [i26]Anshumali Shrivastava:
Optimal Densification for Fast and Accurate Minwise Hashing. CoRR abs/1703.04664 (2017) - [i25]Ryan Spring, Anshumali Shrivastava:
A New Unbiased and Efficient Class of LSH-Based Samplers and Estimators for Partition Function Computation in Log-Linear Models. CoRR abs/1703.05160 (2017) - [i24]Chen Luo, Anshumali Shrivastava:
Arrays of (locality-sensitive) Count Estimators (ACE): High-Speed Anomaly Detection via Cache Lookups. CoRR abs/1706.06664 (2017) - [i23]Chen Luo, Zhengzhang Chen, Lu-An Tang, Anshumali Shrivastava, Zhichun Li:
Accelerating Dependency Graph Learning from Heterogeneous Categorical Event Streams via Knowledge Transfer. CoRR abs/1708.07867 (2017) - [i22]Yiqiu Wang, Anshumali Shrivastava, Junghee Ryu:
FLASH: Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search. CoRR abs/1709.01190 (2017) - [i21]Beidi Chen, Anshumali Shrivastava, Rebecca C. Steorts:
Unique Entity Estimation with Application to the Syrian Conflict. CoRR abs/1710.02690 (2017) - 2016
- [c19]Chen Luo, Anshumali Shrivastava:
SSH (Sketch, Shingle, & Hash) for Indexing Massive-Scale Time Series. NIPS Time Series Workshop 2016: 38-58 - [c18]Anshumali Shrivastava:
Simple and Efficient Weighted Minwise Hashing. NIPS 2016: 1498-1506 - [c17]Anshumali Shrivastava, Arnd Christian König, Mikhail Bilenko:
Time Adaptive Sketches (Ada-Sketches) for Summarizing Data Streams. SIGMOD Conference 2016: 1417-1432 - [c16]Yongshik Moon, Soonhyun Noh, Daedong Park, Chen Luo, Anshumali Shrivastava, Seongsoo Hong, Krishna V. Palem:
CaPSuLe: A camera-based positioning system using learning. SoCC 2016: 235-240 - [i20]Ping Li, Michael Mitzenmacher, Anshumali Shrivastava:
2-Bit Random Projections, NonLinear Estimators, and Approximate Near Neighbor Search. CoRR abs/1602.06577 (2016) - [i19]Ryan Spring, Anshumali Shrivastava:
Scalable and Sustainable Deep Learning via Randomized Hashing. CoRR abs/1602.08194 (2016) - [i18]Anshumali Shrivastava:
Exact Weighted Minwise Hashing in Constant Time. CoRR abs/1602.08393 (2016) - [i17]Amirali Aghazadeh, Andrew S. Lan, Anshumali Shrivastava, Richard G. Baraniuk:
Near-Isometric Binary Hashing for Large-scale Datasets. CoRR abs/1603.03836 (2016) - [i16]Chen Luo, Anshumali Shrivastava:
SSH (Sketch, Shingle, & Hash) for Indexing Massive-Scale Time Series. CoRR abs/1610.07328 (2016) - [i15]Beidi Chen, Anshumali Shrivastava:
Revisiting Winner Take All (WTA) Hashing for Sparse Datasets. CoRR abs/1612.01834 (2016) - [i14]M. Sadegh Riazi, Beidi Chen, Anshumali Shrivastava, Dan S. Wallach, Farinaz Koushanfar:
Sub-linear Privacy-preserving Search with Untrusted Server and Semi-honest Parties. CoRR abs/1612.01835 (2016) - 2015
- [c15]Anshumali Shrivastava, Ping Li:
Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS). UAI 2015: 812-821 - [c14]Anshumali Shrivastava, Ping Li:
Asymmetric Minwise Hashing for Indexing Binary Inner Products and Set Containment. WWW 2015: 981-991 - [i13]Peter Sadosky, Anshumali Shrivastava, Megan Price, Rebecca C. Steorts:
Blocking Methods Applied to Casualty Records from the Syrian Conflict. CoRR abs/1510.07714 (2015) - 2014
- [c13]Anshumali Shrivastava, Ping Li:
In Defense of Minhash over Simhash. AISTATS 2014: 886-894 - [c12]Anshumali Shrivastava, Ping Li:
A new space for comparing graphs. ASONAM 2014: 62-71 - [c11]Anshumali Shrivastava, Ping Li:
Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search. ICML 2014: 557-565 - [c10]Ping Li, Michael Mitzenmacher, Anshumali Shrivastava:
Coding for Random Projections. ICML 2014: 676-684 - [c9]Anshumali Shrivastava, Ping Li:
Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS). NIPS 2014: 2321-2329 - [c8]Anshumali Shrivastava, Ping Li:
Improved Densification of One Permutation Hashing. UAI 2014: 732-741 - [i12]Ping Li, Michael Mitzenmacher, Anshumali Shrivastava:
Coding for Random Projections and Approximate Near Neighbor Search. CoRR abs/1403.8144 (2014) - [i11]Anshumali Shrivastava, Ping Li:
A New Space for Comparing Graphs. CoRR abs/1404.4644 (2014) - [i10]Anshumali Shrivastava, Ping Li:
Graph Kernels via Functional Embedding. CoRR abs/1404.5214 (2014) - [i9]Anshumali Shrivastava, Ping Li:
Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS). CoRR abs/1405.5869 (2014) - [i8]Anshumali Shrivastava, Ping Li:
Improved Densification of One Permutation Hashing. CoRR abs/1406.4784 (2014) - [i7]Anshumali Shrivastava, Ping Li:
In Defense of MinHash Over SimHash. CoRR abs/1407.4416 (2014) - [i6]Anshumali Shrivastava, Ping Li:
An Improved Scheme for Asymmetric LSH. CoRR abs/1410.5410 (2014) - [i5]Anshumali Shrivastava, Ping Li:
Asymmetric Minwise Hashing. CoRR abs/1411.3787 (2014) - 2013
- [c7]Ping Li, Anshumali Shrivastava, Arnd Christian König:
b-bit minwise hashing in practice. Internetware 2013: 13:1-13:10 - [c6]Anshumali Shrivastava, Ping Li:
Beyond Pairwise: Provably Fast Algorithms for Approximate k-Way Similarity Search. NIPS 2013: 791-799 - [i4]Ping Li, Michael Mitzenmacher, Anshumali Shrivastava:
Coding for Random Projections. CoRR abs/1308.2218 (2013) - 2012
- [c5]Xu Sun, Anshumali Shrivastava, Ping Li:
Fast multi-task learning for query spelling correction. CIKM 2012: 285-294 - [c4]Anshumali Shrivastava, Ping Li:
Fast Near Neighbor Search in High-Dimensional Binary Data. ECML/PKDD (1) 2012: 474-489 - [c3]Ping Li, Anshumali Shrivastava, Arnd Christian König:
GPU-based minwise hashing: GPU-based minwise hashing. WWW (Companion Volume) 2012: 565-566 - [c2]Xu Sun, Anshumali Shrivastava, Ping Li:
Query spelling correction using multi-task learning. WWW (Companion Volume) 2012: 613-614 - [i3]Ping Li, Anshumali Shrivastava, Arnd Christian König:
b-Bit Minwise Hashing in Practice: Large-Scale Batch and Online Learning and Using GPUs for Fast Preprocessing with Simple Hash Functions. CoRR abs/1205.2958 (2012) - 2011
- [c1]Ping Li, Anshumali Shrivastava, Joshua L. Moore, Arnd Christian König:
Hashing Algorithms for Large-Scale Learning. NIPS 2011: 2672-2680 - [i2]Ping Li, Anshumali Shrivastava, Joshua L. Moore, Arnd Christian König:
Hashing Algorithms for Large-Scale Learning. CoRR abs/1106.0967 (2011) - [i1]Ping Li, Anshumali Shrivastava, Arnd Christian König:
Training Logistic Regression and SVM on 200GB Data Using b-Bit Minwise Hashing and Comparisons with Vowpal Wabbit (VW). CoRR abs/1108.3072 (2011)
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-01-23 00:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
