BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1112
DTSTAMP:20230914T125951Z
SUMMARY:Approximating a polynomial as a sum of simple polynomials
DESCRIPTION:Speaker: Neeraj Kayal (Microsoft Research)\n\nAbstract: \nIn th
 is talk\, we will consider algorithmic problems which follow the following
  template: given a real-valued multivariate polynomial f(x) of degree d\, 
 is it approximately equal to a sum of a few "simple" polynomials\, i.e Is 
 f ~= g_1(x) + g_2(x) + ... + g_r(x)? Examples/special cases of this proble
 m template are low-rank approximation of a matrix and tensor decomposition
 . We will see many applications including independent component analysis\,
  subspace clustering\, Learning Gaussian mixture models and (language) top
 ic modelling. In the next part\, we will see how techniques from algebraic
  complexity can potentially be used to algorithmically solve such problems
  efficiently. We will formulate some conjectures in this regard. We resolv
 e one such conjecture which leads to a more noise-resilient algorithm for 
 the relatively well-studied problem of tensor decomposition.\nYouTube Link
  - https://www.youtube.com/watch?v=ZCU74TXmG9o\n
URL:https://www.tcs.tifr.res.in/web/events/1112
DTSTART;TZID=Asia/Kolkata:20210126T160000
DTEND;TZID=Asia/Kolkata:20210126T170000
END:VEVENT
END:VCALENDAR