BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/357
DTSTAMP:20230914T125921Z
SUMMARY:Fast Low Rank Approximation via Random Projections
DESCRIPTION:Speaker: Gugan Thoppe\n\nAbstract: \nGiven an m x n matrix A\,
we define the rank-k approximation of A as a matrix B of same size and of
rank at most k such that A and B are close in the Frobenius norm. In this
talk\, we will first give a geometric interpretation of this problem and
relate it to the singular value of decomposition (SVD) of the matrix A. We
will then use this knowledge to understand why a fast low rank approximat
ion algorithm is to be expected. If time permits\, we will see some applic
ations of low rank approximations to a class of fixed point and minimizati
on problems.\n\n \n
URL:https://www.tcs.tifr.res.in/web/events/357
DTSTART;TZID=Asia/Kolkata:20130419T143000
DTEND;TZID=Asia/Kolkata:20130419T160000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR