← Search

Aditya Krishnan

3 accepted papers

2025

Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search

NeurIPS 2025poster

Clustering-based nearest neighbor search algorithms partition points into shards to form an index, and search only a subset of shards to process a query. Even though search efficacy is heavily influenced by the algorithm that identifies the shards to probe, it has received little attention in the li…

Cited by 0SourcecodeScholar
2025

PTQ4ADM: Post-Training Quantization for Efficient Text Conditional Audio Diffusion Models

ICASSP 2025accepted

Denoising diffusion models have emerged as state-of-the-art in generative tasks across image, audio, and video domains, producing high-quality, diverse, and contextually relevant data. However, their broader adoption is limited by high computational costs and large memory footprints. Post-training q…

Cited by 0SourceScholar
2020

Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension

ICML 2020poster

Spectral functions of large matrices contains important structural information about the underlying data, and is thus becoming increasingly important. Many times, large matrices representing real-world data are sparse or doubly sparse (i.e., sparse in both rows and columns), and are accessed as a st…

Cited by 18SourcePDFScholar