BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Simons Foundation - ECPv6.6.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Simons Foundation
X-ORIGINAL-URL:https://www.simonsfoundation.org
X-WR-CALDESC:Events for Simons Foundation
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20161106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20160513T170000
DTEND;TZID=America/New_York:20160513T181500
DTSTAMP:20260406T062952
CREATED:20160420T040000Z
LAST-MODIFIED:20211208T181552Z
UID:347-1463158800-1463163300@www.simonsfoundation.org
SUMMARY:Universality Phenomena in Machine Learning\, and Their Applications
DESCRIPTION:A canonical task in machine learning is to fit a model (from a certain class) to a dataset. In many settings there is little theoretical understanding of the algorithms used for this task\, since they involve nonconvex optimization. \nWe have empirically observed that in many settings the models fitted to real-life datasets display randomlike properties — the model parameters behave like random numbers for various tests. This is somewhat reminiscent of the ‘universality’ phenomenon in mathematics and physics\, whereby matrices in a host of settings turn out to display properties similar to those of the Gaussian ensemble. \nIn this talk\, Sanjeev Arora will describe how these randomlike properties can be used to gain a new understanding in some settings — for example\, they can offer insights into linear algebraic properties of word meanings in natural languages\, and reversibility properties of fully connected deep nets. In some cases\, they can lead us to provably efficient algorithms\, such as algorithms for making inferences in a topic model. \nArora is the Charles C. Fitzmorris Professor of Computer Science at Princeton University. His research area spans several areas of theoretical Computer Science including computational complexity and algorithm design\, and theoretical problems in machine learning. He has received the ACM-EATCS Gödel Prize (in 2001 and 2010)\, Packard Fellowship (1997)\, the ACM Infosys Foundation Award in the Computing Sciences (2012)\, the Fulkerson Prize (2012)\, and the Simons Investigator Award (2012).
URL:https://www.simonsfoundation.org/event/universality-phenomena-in-machine-learning-and-their-applications/
LOCATION:Gerald D. Fischbach Auditorium\, 160 5th Avenue\, New York\, NY\, 10010\, United States
CATEGORIES:Interdisciplinary
ATTACH;FMTTYPE=image/jpeg:https://sf-web-assets-prod.s3.amazonaws.com/wp-content/uploads/2017/07/10180947/Arora_067.jpg
END:VEVENT
END:VCALENDAR