← Search

Rohan Kadekodi

2 accepted papers

2026

Tactic: Adaptive Sparse Attention with Clustering and Distribution Fitting for Long-Context LLMs

ICLR 2026poster

Long-context models are essential for many applications but face inefficiencies in loading large KV caches during decoding. Prior methods enforce fixed token budgets for sparse attention, assuming a set number of tokens can approximate full attention. However, these methods overlook variations in th…

Cited by 0SourceScholar
2019

DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node

NeurIPS 2019poster

Current state-of-the-art approximate nearest neighbor search (ANNS) algorithms generate indices that must be stored in main memory for fast high-recall search. This makes them expensive and limits the size of the dataset. We present a new graph-based indexing and search system called DiskANN that ca…