Published multiple papers, including 'Testing with Non-identically Distributed Samples' (under review at TMLR), 'Graph-Based Algorithms for Diverse Similarity Search' (accepted at ICML 2025), 'Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs' (accepted at ICML 2025), and more.
Research Experience
Worked at Microsoft Research India for one year with Deeparnab Chakrabarty; Postdoctoral research fellow at the Broad Institute of MIT and Harvard, under the guidance of Prof. Caroline Uhler; Research intern at Adobe Research in summer 2019, supervised by Tung Mai and Anup Rao.
Education
Ph.D.: Stanford University, advised by Moses Charikar and Aaron Sidford; M.S.: Indian Institute of Science, advised by Prof. Arnab Bhattacharyya.
Background
Research interests: Algorithms, Machine Learning, Statistics, and Information Theory, with a recent focus on large-scale retrieval problems. Previously a senior researcher at Microsoft Research India.
Miscellany
Coordinated 'Algorithms and Friends' at Stanford, offering help in solving algorithmic questions that came up in applied research.