Developed DiskANN, a system for handling large-scale vector search problems, extensively used within Microsoft; PhD thesis on 'Approximation Techniques for Stochastic Combinatorial Optimization'.
Research Experience
Simons Postdoctoral Fellow at the CS Department in Princeton University from 2012-2014; Visited IEOR Department at Columbia University in Fall 2014; Currently a principal researcher at Microsoft Research India.
Education
Completed PhD at Carnegie Mellon University in 2012, advised by Anupam Gupta; Undergraduate from IIT Madras.
Background
Research interests include designing new algorithms and data structures for very large-scale vector search (a.k.a. approximate nearest neighbor search). Additionally, interested in approximation algorithms for graph-(connectivity/flow) problems and clustering problems, as well as models that incorporate uncertainty in the input such as online algorithms and stochastic optimization.