BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/844
DTSTAMP:20230914T125940Z
SUMMARY:Optimization for Derandomization: Polynomial Identity Testing\, Geo
 desically Convex Optimization and More
DESCRIPTION:Speaker: Ankit Garg (Microsoft Research New England\n1 Memorial
  Dr.\nCambridge\, MA 02142\nUnited States of America)\n\nAbstract: \nRando
 mness plays an important role across scientific disciplines. In theoretica
 l computer science\, there is a large body of work trying to understand th
 e role of randomness in computation. An important part in this quest is th
 e polynomial identity testing question which asks if one can test identiti
 es deterministically. In this talk\, I will talk about deterministic ident
 ity testing of a special class of polynomials using tools from optimizatio
 n such as alternating minimization and second order methods. The class of 
 problems that we solve form an amazing web of connections across areas suc
 h as geodesically convex optimization\, quantum information theory\, repre
 sentation theory\, non-commutative algebra and functional analysis. I will
  also outline applications to these areas (the talk will be based on sever
 al joint works with Zeyuan Allen-Zhu\, Peter Burgisser\, Leonid Gurvits\, 
 Yuanzhi Li\, Rafael Oliveira\, Michael Walter and Avi Wigderson).\n
URL:https://www.tcs.tifr.res.in/web/events/844
DTSTART;TZID=Asia/Kolkata:20180110T143000
DTEND;TZID=Asia/Kolkata:20180110T153000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR