BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1687
DTSTAMP:20260210T084434Z
SUMMARY:Sparsifying Sums of Positive Semidefinite Matrices
DESCRIPTION:Speaker: Pravesh K. Kothari (Princeton University)\n\nAbstract:
  \nI will talk about a new instance-specific sparsification theorem for su
 ms of PSD matrices. As a corollary\, I will show that every Cayley graph o
 n any group has a weighted Cayley sparsifier with O(\\log^4 |G|) generator
 s. \nBased on joint work with Arpon Basu (Princeton)\, Yang Liu (CMU)\, a
 nd Raghu Meka (UCLA). \n \n \nShort Bio: Pravesh K Kothari received hi
 s Ph. D. from the University of Texas at Austin in 2016 after a Bachelor's
  degree from Indian Institute of Technology\, Kanpur. He is currently an A
 ssistant Professor in the Computer Science Department at Princeton Univers
 ity. Earlier\, from 2019-2023\, he was an Assistant Professor in the Compu
 ter Science Department at Carnegie Mellon University. Dr. Kothari was a Re
 search Instructor of Computer Science jointly hosted by the Institute for 
 Advanced Study\, Princeton and the Department of Computer Science at Princ
 eton University from 2016-19.Dr. Kothari's research interests span several
  topics in theoretical computer science such as convex optimization and ap
 plications to algorithm design\, algorithms and lower bounds for statistic
 al estimation and average-case combinatorial optimization\, and spectral m
 ethods and connections to random matrix theory\, coding theory and extrema
 l combinatorics.Dr Kothari is a recipient of the Presburger Award (2024)\,
  IIT Kanpur Young Alumnus Award (2023)\, Sloan Fellowship (2022)\, NSF Car
 eer Award (2021)\, and Simons Award for Graduate students in Theoretical C
 omputer Science (2014).\n
URL:https://www.tcs.tifr.res.in/web/events/1687
DTSTART;TZID=Asia/Kolkata:20260213T113000
DTEND;TZID=Asia/Kolkata:20260213T123000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR