BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20171105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20171010T170000
DTEND;TZID=America/New_York:20171010T180000
DTSTAMP:20250328T150724Z
CREATED:20230717T173349Z
LAST-MODIFIED:20250328T150724Z
UID:10000038-1507654800-1507658400@cmsa.fas.harvard.edu
SUMMARY:2017 Ding Shum Lecture
DESCRIPTION:Leslie Valiant will be giving the inaugural talk of the Ding Shum Lectures on Tuesday\, October 10 at 5:00 pm in Science Center Hall D\, Cambridge\, MA. \nLearning as a Theory of Everything \nAbstract: We start from the hypothesis that all the information that resides in living organisms was initially acquired either through learning by an individual or through evolution. Then any unified theory of evolution and learning should be able to characterize the capabilities that humans and other living organisms can possess or acquire. Characterizing these capabilities would tell us about the nature of humans\, and would also inform us about feasible targets for automation. With this purpose we review some background in the mathematical theory of learning. We go on to explain how Darwinian evolution can be formulated as a form of learning. We observe that our current mathematical understanding of learning is incomplete in certain important directions\, and conclude by indicating one direction in which further progress would likely enable broader phenomena of intelligence and cognition to be realized than is possible at present. \n 
URL:https://cmsa.fas.harvard.edu/event/2017-ding-shum-lecture/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Ding Shum Lecture,Event,Public Lecture,Special Lectures
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/Ding-Shum-lecture-3.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20171002T091500
DTEND;TZID=America/New_York:20171002T173000
DTSTAMP:20250328T150846Z
CREATED:20230717T172938Z
LAST-MODIFIED:20250328T150846Z
UID:10000036-1506935700-1506965400@cmsa.fas.harvard.edu
SUMMARY:The 2017 Charles River Lectures
DESCRIPTION:Charles River with Bench at Sunset\nJointly organized by Harvard University\, Massachusetts Institute of Technology\, and Microsoft Research New England\, the Charles River Lectures on Probability and Related Topics is a one-day event for the benefit of the greater Boston area mathematics community. \nThe 2017 lectures will take place 9:15am – 5:30pm on Monday\, October 2 at Harvard University  in the Harvard Science Center. \n\n\n\n*************************************************** \nUPDATED LOCATION\nHarvard University\nHarvard Science Center (Halls C & E)\n1 Oxford Street\, Cambridge\, MA 02138 (Map)\nMonday\, October 2\, 2017\n9:15 AM – 5:30 PM\n************************************************** \nPlease note that registration has closed. \nSpeakers:\n\nPaul Bourgade (Courant Institute\, NYU)\nMassimiliano Gubinelli (University of Bonn)\nAndrea Montanari (Stanford University)\nRoman Vershynin (University of California\, Irvine)\nOfer Zeitouni (Weizmann Institute)\n\nAgenda:\nIn Harvard Science Center Hall C: \n8:45 am – 9:15 am: Coffee/light breakfast \n9:15 am – 10:15 am: Ofer Zeitouni \nTitle: Noise stability of the spectrum of large matrices \nAbstract: The spectrum of large non-normal matrices is notoriously sensitive to perturbations\, as the example of nilpotent matrices shows. Remarkably\, the spectrum of these matrices perturbed by polynomially (in the dimension) vanishing additive noise is remarkably stable. I will describe some results and the beginning of a theory. \nThe talk is based on joint work with Anirban Basak and Elliot Paquette\, and earlier works with Feldheim\, Guionnet\, Paquette and Wood.\n\n10:20 am – 11:20 am: Andrea Montanari \nTitle: Algorithms for estimating low-rank matrices  \nAbstract: Many interesting problems in statistics can be formulated as follows. The signal of interest is a large low-rank matrix with additional structure\, and we are given a single noisy view of this matrix. We would like to estimate the low rank signal by taking into account optimally the signal structure. I will discuss two types of efficient estimation procedures based on message-passing algorithms and semidefinite programming relaxations\, with an emphasis on asymptotically exact results. \n11:20 am – 11:45 am: Break \n11:45 am – 12:45 pm: Paul Bourgade \nTitle: Random matrices\, the Riemann zeta function and trees \nAbstract: Fyodorov\, Hiary & Keating have conjectured that the maximum of the characteristic polynomial of random unitary matrices behaves like extremes of log-correlated Gaussian fields. This allowed them to predict the typical size of local maxima of the Riemann zeta function along the critical axis. I will first explain the origins of this conjecture\, and then outline the proof for the leading order of the maximum\, for unitary matrices and the zeta function. This talk is based on joint works with Arguin\, Belius\, Radziwill and Soundararajan. \n1:00 pm – 2:30 pm: Lunch \nIn Harvard Science Center Hall E: \n2:45 pm – 3:45 pm: Roman Vershynin \nTitle: Deviations of random matrices and applications \nAbstract: Uniform laws of large numbers provide theoretical foundations for statistical learning theory. This lecture will focus on quantitative uniform laws of large numbers for random matrices. A range of illustrations will be given in high dimensional geometry and data science. \n3:45 pm – 4:15 pm: Break \n4:15 pm – 5:15 pm: Massimiliano Gubinelli \nTitle: Weak universality and Singular SPDEs \nAbstract: Mesoscopic fluctuations of microscopic (discrete or continuous) dynamics can be described in terms of nonlinear stochastic partial differential equations which are universal: they depend on very few details of the microscopic model. This universality comes at a price: due to the extreme irregular nature of the random field sample paths\, these equations turn out to not be well-posed in any classical analytic sense. I will review recent progress in the mathematical understanding of such singular equations and of their (weak) universality and their relation with the Wilsonian renormalisation group framework of theoretical physics. \nOrganizers:\n Alexei Borodin\, Henry Cohn\, Vadim Gorin\, Elchanan Mossel\, Philippe Rigollet\, Scott Sheffield\, and H.T. Yau
URL:https://cmsa.fas.harvard.edu/event/the-2017-charles-river-lectures/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Event,Public Lecture,Special Lectures
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/Charles-River-Lectures-2017-pdf.jpeg
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20170907T170000
DTEND;TZID=America/New_York:20170907T180000
DTSTAMP:20250305T183135Z
CREATED:20230717T172748Z
LAST-MODIFIED:20250305T183135Z
UID:10000035-1504803600-1504807200@cmsa.fas.harvard.edu
SUMMARY:Noga Alon Public Talk
DESCRIPTION:Noga Alon (Tel Aviv University) will be giving a public talk on September 7\, 2017\,as part of the program on combinatorics and complexity hosted by the CMSA during AY17-18.  The talk will be at 5:00pm in Askwith Hall\, 13 Appian Way\, Cambridge\, MA. \nTitle: Graph Coloring: Local and Global \nAbstract: Graph Coloring is arguably the most popular subject in Discrete Mathematics\, and its combinatorial\, algorithmic and computational aspects have been studied intensively. The most basic notion in the area\, the chromatic number of a graph\, is an inherently global property. This is demonstrated by the hardness of computation or approximation of this invariant as well as by the existence of graphs with arbitrarily high chromatic number and no short cycles. The investigation of these graphs had a profound impact on Graph Theory and Combinatorics. It combines combinatorial\, probabilistic\, algebraic and topological techniques with number theoretic tools. I will describe the rich history of the subject focusing on some recent results. \n 
URL:https://cmsa.fas.harvard.edu/event/noga-alon-public-talk-9-7-17/
CATEGORIES:Event,Public Lecture
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/Noga-Poster-2-1.png
END:VEVENT
END:VCALENDAR