BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Superpower Daily//AI Events//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Superpower Daily AI events
BEGIN:VEVENT
UID:472c7e72-f0fe-4e47-b96e-329d0caf7ab4@superpowerdaily.com
DTSTAMP:20261119T140356Z
LAST-MODIFIED:20261119T140356Z
DTSTART:20261204T200000Z
DTEND:20261204T210000Z
SUMMARY:Thesis Defense - Lichen Zhang
DESCRIPTION:Lichen Zhang will present efficient\, provably correct algorith
 ms spanning support vector machines\, matrix completion\, adaptive data st
 ructures\, and quantum coreset construction. The talk will highlight near-
 linear runtimes\, robustness through differential privacy\, and query-effi
 ciency guarantees grounded in randomized linear algebra and optimization.\
 nDetails: https://superpowerdaily.com/events/thesis-defense-lichen-zhang-4
 72c7e72-f0fe-4e47-b96e-329d0caf7ab4\nRegister: https://calendar.mit.edu/ev
 ent/thesis-defense-lichen-zhang
LOCATION:Cambridge\, MA
URL:https://superpowerdaily.com/events/thesis-defense-lichen-zhang-472c7e72
 -f0fe-4e47-b96e-329d0caf7ab4
STATUS:TENTATIVE
TRANSP:TRANSPARENT
END:VEVENT
END:VCALENDAR
