← Authors

Anshumali Shrivastava

52 papers · 2011–2025 · 10 conferences · across top CS/AI conferences

Achievements

🐝 Cross-Pollinator (5) 🌍 Conference Polyglot (10) πŸƒ Academic Marathon (14) 🌈 Renaissance Researcher (10) πŸŒ‰ Interdisciplinary Bridge πŸ—ΊοΈ Taxonomy Completionist (12) 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🏠 Conference Loyalist (21) 🌟 Keyword Trendsetter Combo (3) πŸ† Grand Slam πŸ‘‘ Triple Crown 🀝 Dynamic Duo (15) πŸ”¬ Deep Specialist (21) πŸ† Keyword Champion (3) πŸš€ Conference Pioneer πŸ—ƒοΈ Keyword Collector (223) πŸ“ˆ Trend Setter ⚑ Prolific Year (5) πŸ”₯ Unstoppable (10) πŸ’Ž Century Club (52)

Conferences

NIPS (21) ICML (14) ICLR (5) AAAI (3) AISTATS (2) IJCAI (2) UAI (2) ACL (1) EMNLP (1) OSDI (1)

Top co-authors

Zhaozhuo Xu (15) Benjamin Coleman (8) Beidi Chen (8) Tianyi Zhang (8) Aditya Desai (7) Zichang Liu (6) Ping Li (6) Zhao Song (4) Tharun Medini (4) Anastasios Kyrillidis (3)

Research topics

Education (1)

Keywords

nearest neighbor search (7) model compression (7) locality sensitive hashing (6) minwise hashing (5) locality-sensitive hashing (4) approximate nearest neighbor (4) memory efficiency (3) memory optimization (3) representation learning (3) large language model (3) inference optimization (3) similarity search (3) parameter sharing (3) maximum inner product search (3) contrastive learning (2) similarity estimation (2) distributed training (2) approximate search (2) stochastic gradient descent (2) neural network optimization (2)

Papers

Sketch to Adapt: Fine-Tunable Sketches for Efficient LLM Adaptation ICML 2025
CoVE: Compressed Vocabulary Expansion Makes Better LLM-based Recommender Systems ACL 2025
ZEN: Empowering Distributed Training with Sparsity-driven Data Synchronization OSDI 2025
LeanQuant: Accurate and Scalable Large Language Model Quantization with Loss-error-aware Grid ICLR 2025
KV Cache is 1 Bit Per Channel: Efficient Large Language Model Inference with Coupled Quantization NIPS 2024
SS1: Accelerating Inference with Fast and Expressive Sketch Structured Transform NIPS 2024
Soft Prompt Recovers Compressed LLMs, Transferably ICML 2024
In defense of parameter sharing for model-compression ICLR 2024
NoMAD-Attention: Efficient LLM Inference on CPUs Through Multiply-add-free Attention NIPS 2024
Graph Self-supervised Learning via Proximity Distribution Minimization UAI 2023
One-Pass Distribution Sketch for Measuring Data Heterogeneity in Federated Learning NIPS 2023
Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Time NIPS 2023
DESSERT: An Efficient Algorithm for Vector Set Search with Vector Set Queries NIPS 2023
A Tale of Two Efficient Value Iteration Algorithms for Solving Linear MDPs with Large Action Space AISTATS 2023
Learning Multimodal Data Augmentation in Feature Space ICLR 2023
Hardware-Aware Compression with Random Operation Access Specific Tile (ROAST) Hashing ICML 2023
Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Time ICML 2023
Retaining Knowledge for Learning with Dynamic Definition NIPS 2022
Structural Contrastive Representation Learning for Zero-shot Multi-label Text Classification EMNLP 2022
The trade-offs of model size in large recommendation models : 100GB to 10MB Criteo-tb DLRM model NIPS 2022
Graph Reordering for Cache-Efficient Near Neighbor Search NIPS 2022
DRAGONN: Distributed Randomized Approximate Gradients of Neural Networks ICML 2022
One-Pass Diversified Sampling with Application to Terabyte-Scale Genomic Sequence Streams ICML 2022
Locality Sensitive Teaching NIPS 2021
Revisiting Consistent Hashing with Bounded Loads AAAI 2021
Raw Nav-merge Seismic Data to Subsurface Properties with MLP based Multi-Modal Information Unscrambler NIPS 2021
SOLAR: Sparse Orthogonal Learned and Random Embeddings ICLR 2021
MONGOOSE: A Learnable LSH Framework for Efficient Neural Network Training ICLR 2021
Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures NIPS 2021
A Tale of Two Efficient and Informative Negative Sampling Distributions ICML 2021
SDM-Net: A simple and effective model for generalized zero-shot learning UAI 2021
Practical Near Neighbor Search via Group Testing NIPS 2021
Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier with Application to Real-Time Information Filtering on the Web NIPS 2020
Angular Visual Hardness ICML 2020
Sub-linear Memory Sketches for Near Neighbor Search on Streaming Data ICML 2020
FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints AAAI 2020
Mutual Information Estimation using LSH Sampling IJCAI 2020
Extreme Classification in Log Memory using Count-Min Sketch: A Case Study of Amazon Search with 50M Products NIPS 2019
Scaling-Up Split-Merge MCMC with Locality Sensitive Sampling (LSS) AAAI 2019
Compressing Gradient Optimizers via Count-Sketches ICML 2019
Fast and Accurate Stochastic Gradient Estimation NIPS 2019
Topkapi: Parallel and Fast Sketches for Finding Top-K Frequent Elements NIPS 2018
MISSION: Ultra Large-Scale Feature Selection using Count-Sketches ICML 2018
Optimal Densification for Fast and Accurate Minwise Hashing ICML 2017
RHash: Robust Hashing via L_infinity-norm Distortion IJCAI 2017
Simple and Efficient Weighted Minwise Hashing NIPS 2016
Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS) NIPS 2014
In Defense of Minhash over Simhash AISTATS 2014
Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search ICML 2014
Coding for Random Projections ICML 2014
Beyond Pairwise: Provably Fast Algorithms for Approximate $k$-Way Similarity Search NIPS 2013
Hashing Algorithms for Large-Scale Learning NIPS 2011