← Search

Aditya Desai

10 accepted papers

2026

vAttention: Verified Sparse Attention via Sampling

ICLR 2026poster

State-of-the-art sparse attention methods for reducing decoding latency fall into two main categories: approximate top-$k$ (and its extension, top-$p$) and recently introduced sampling-based estimation. However, these approaches are fundamentally limited in their ability to approximate full attentio…

Cited by 0SourcecodeScholar
2026

vCache: Verified Semantic Prompt Caching

ICLR 2026poster

Semantic caches return cached responses for semantically similar prompts to reduce LLM inference latency and cost. They embed cached prompts and store them alongside their response in a vector database. Embedding similarity metrics assign a numerical score to quantify the similarity between a reques…

Cited by 0SourcecodeScholar
2025

HashAttention: Semantic Sparsity for Faster Inference

ICML 2025poster

Leveraging long contexts is crucial for advanced AI systems, but attention computation poses a scalability challenge. While scaled dot-product attention (SDPA) exhibits token sparsity, i.e. only a few pivotal tokens significantly contribute to output, exploiting this sparsity remains challenging. Ex…

Cited by 3SourcePDFScholar
2025

Sketch to Adapt: Fine-Tunable Sketches for Efficient LLM Adaptation

ICML 2025poster

Adapting pre-trained large language models (LLMs) is crucial but challenging due to their enormous size. Parameter-efficient fine-tuning (PEFT) techniques typically employ additive adapters applied to frozen model weights. To further reduce memory usage, model weights are often compressed through qu…

Cited by 0SourcePDFScholar
2024

SS1: Accelerating Inference with Fast and Expressive Sketch Structured Transform

NeurIPS 2024poster

Tensor multiplication with learned weight matrices is the fundamental building block in deep learning models. These matrices can often be sparsified, decomposed, quantized, or subjected to random parameter sharing without losing accuracy, suggesting the possibility of more efficient transforms. Alth…

2023

Hardware-Aware Compression with Random Operation Access Specific Tile (ROAST) Hashing

ICML 2023poster

Advancements in deep learning are often associated with increasing model sizes. Training and deploying large models require sophisticated hardware and incur significantly higher costs. Thus, model compression is a widely explored approach to solving the problem. However, SOTA techniques fall short i…

2023

Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Time

NeurIPS 2023poster

Large language models(LLMs) have sparked a new wave of exciting AI applications. Hosting these models at scale requires significant memory resources. One crucial memory bottleneck for the deployment stems from the context window. It is commonly recognized that model weights are memory hungry; howeve…

Cited by 200SourcePDFScholar
2022

The trade-offs of model size in large recommendation models : 100GB to 10MB Criteo-tb DLRM model

NeurIPS 2022accept

Embedding tables dominate industrial-scale recommendation model sizes, using up to terabytes of memory. A popular and the largest publicly available machine learning MLPerf benchmark on recommendation data is a Deep Learning Recommendation Model (DLRM) trained on a terabyte of click-through data. It…

Cited by 10SourcePDFScholar
2021

Raw Nav-merge Seismic Data to Subsurface Properties with MLP based Multi-Modal Information Unscrambler

NeurIPS 2021poster

Traditional seismic inversion (SI) maps the hundreds of terabytes of raw-field data to subsurface properties in gigabytes. This inversion process is expensive, requiring over a year of human and computational effort. Recently, data-driven approaches equipped with Deep learning (DL) are envisioned t…

Cited by 9SourcePDFScholar