BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1399
DTSTAMP:20240405T070007Z
SUMMARY:Approximate Nearest Neighbor Search algorithms for web-scale search
  and recommendation
DESCRIPTION:Speaker: Ravishankar Krishnaswamy (Microsoft Research Lab – I
 ndia)\n\nAbstract: \n\nWeb-scale search and recommendation scenarios incre
 asingly use Approximate Nearest Neighbor Search (ANNS) algorithms to index
  and retrieve objects based on the similarity of their learnt representati
 ons in a geometric space. Since these scenarios often span billions or tri
 llions of objects\, efficient and scalable ANNS algorithms are critical to
  making these systems practical.\nIn this talk we discuss some recent empi
 rical progress on this problem. Specifically\, we present DiskANN\, an ANN
 S algorithm that can index a billion points and serve queries at latencies
  of few milliseconds on a single commodity machine. This represents an ord
 er of magnitude more points indexed per machine than previous work.  We w
 ill also discuss some fundamental open problems in this space in the latte
 r half of the talk.\nBased on joint works with Harsha Simhadri\, Sujas J S
 ubramanya\, Aditi Singh\, Rohan Kadekodi\, Devvrit\, Shikhar Jaiswal\, Mag
 dalen Dobson\, Siddharth Gollapudi\, Neel Karia\, Varun Sivashankar\, and 
 Varun Suriyanarayana.\nShort Bio:\nHe is a principal researcher at Microso
 ft Research India. His PhD was completed at Carnegie Mellon University in 
 2012. From 2012-2014\, a Simons Postdoctoral Fellowship was held by him at
  the CS Department in Princeton University. Long\, long ago\, he was an un
 dergrad at IIT Madras. Broad interest in basic problems in algorithms and 
 optimization characterizes his work. Lately\, work on the design of very l
 arge-scale (billions of vectors) approximate nearest neighbor search (ANNS
 ) has been undertaken as part of the DiskANN project. Also\, he spends his
  time thinking about basic problems in online and approximation algorithms
 \, especially for graph-theoretic and clustering problems.\n
URL:https://www.tcs.tifr.res.in/web/events/1399
DTSTART;TZID=Asia/Kolkata:20240423T160000
DTEND;TZID=Asia/Kolkata:20240423T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR