BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220909T120000
DTEND;TZID=America/New_York:20220909T130000
DTSTAMP:20240301T084734Z
CREATED:20240301T084734Z
LAST-MODIFIED:20240301T084734Z
UID:10002889-1662724800-1662728400@cmsa.fas.harvard.edu
SUMMARY:Duality in Einstein’s Gravity
DESCRIPTION:Title: Duality in Einstein’s Gravity \nAbstract: Electric-Magnetic duality has been a key feature behind our understanding of Quantum Field Theory for over a century. In this talk I will describe a similar property in Einstein’s gravity. The gravitational duality reveals\, in turn\, a wide range of new IR phenomena\, including aspects of the double copy for scattering amplitudes\, asymptotic symmetries and more.
URL:https://cmsa.fas.harvard.edu/event/duality-in-einsteins-gravity/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220914T120000
DTEND;TZID=America/New_York:20220914T130000
DTSTAMP:20240229T110925Z
CREATED:20240214T114614Z
LAST-MODIFIED:20240229T110925Z
UID:10002707-1663156800-1663160400@cmsa.fas.harvard.edu
SUMMARY:Strategyproof-Exposing Mechanisms Descriptions
DESCRIPTION:Colloquium \nSpeaker: Yannai Gonczarowski (Harvard)\n\nTitle: Strategyproof-Exposing Mechanisms Descriptions \nAbstract: One of the crowning achievements of the field of Mechanism Design has been the design and usage of the so-called “Deferred Acceptance” matching algorithm. Designed in 1962 and awarded the Nobel Prize in 2012\, this algorithm has been used around the world in settings ranging from matching students to schools to matching medical doctors to residencies. A hallmark of this algorithm is that unlike many other matching algorithms\, it is “strategy-proof”: participants can never gain by misreporting their preferences (say\, over schools) to the algorithm. Alas\, this property is far from apparent from the algorithm description. Its mathematical proof is so delicate and complex\, that (for example) school districts in which it is implemented do not even attempt to explain to students and parents why this property holds\, but rather resort to an appeal to authority: Nobel laureates have proven this property\, so one should listen to them. Unsurprisingly perhaps\, there is a growing body of evidence that participants in Deferred Acceptance attempt (unsuccessfully) to “game it\,” which results in a suboptimal match for themselves and for others. \nBy developing a novel framework of algorithm description simplicity—grounded at the intersection between Economics and Computer Science—we present a novel\, starkly different\, yet equivalent\, description for the Deferred Acceptance algorithm\, which\, in a precise sense\, makes its strategyproofness far more apparent. Our description does have a downside\, though: some other of its most fundamental properties—for instance\, that no school exceeds its capacity—are far less apparent than from all traditional descriptions of the algorithm. Using the theoretical framework that we develop\, we mathematically address the question of whether and to what extent this downside is unavoidable\, providing a possible explanation for why our description of the algorithm has eluded discovery for over half a century. Indeed\, it seems that in the design of all traditional descriptions of the algorithm\, it was taken for granted that properties such as no capacity getting exceeded should be apparent. Our description emphasizes the property that is important for participants to correctly interact with the algorithm\, at the expense of properties that are mostly of interest to policy makers\, and thus has the potential of vastly improving access to opportunity for many populations. Our theory provides a principled way of recasting algorithm descriptions in a way that makes certain properties of interest easier to explain and grasp\, which we also support with behavioral experiments in the lab. \nJoint work with Ori Heffetz and Clayton Thomas.
URL:https://cmsa.fas.harvard.edu/event/collquium-title-tba/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-09.14.22-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220914T140000
DTEND;TZID=America/New_York:20220914T150000
DTSTAMP:20240301T091205Z
CREATED:20230808T183823Z
LAST-MODIFIED:20240301T091205Z
UID:10001210-1663164000-1663167600@cmsa.fas.harvard.edu
SUMMARY:Breaking the one-mind-barrier in mathematics using formal verification
DESCRIPTION:New Technologies in Mathematics Seminar \nSpeaker: Johan Commelin\, Mathematisches Institut\, Albert-Ludwigs-Universität Freiburg \nTitle: Breaking the one-mind-barrier in mathematics using formal verification \nAbstract: In this talk I will argue that formal verification helps break the one-mind-barrier in mathematics. Indeed\, formal verification allows a team of mathematicians to collaborate on a project\, without one person understanding all parts of the project. At the same time\, it also allows a mathematician to rapidly free mental RAM in order to work on a different component of a project. It thus also expands the one-mind-barrier. \nI will use the Liquid Tensor Experiment as an example\, to illustrate the above two points. This project recently finished the formalization of the main theorem of liquid vector spaces\, following up on a challenge by Peter Scholze. \nVideo
URL:https://cmsa.fas.harvard.edu/event/breaking-the-one-mind-barrier-in-mathematics-using-formal-verification/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:New Technologies in Mathematics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220916T110000
DTEND;TZID=America/New_York:20220916T120000
DTSTAMP:20240301T084243Z
CREATED:20240214T105636Z
LAST-MODIFIED:20240301T084243Z
UID:10002686-1663326000-1663329600@cmsa.fas.harvard.edu
SUMMARY:Derivation of AdS/CFT for Vector Models
DESCRIPTION:Member Seminar\n\nSpeaker: Shai Chester\n\nTitle: Derivation of AdS/CFT for Vector Models\nAbstract: We derive an explicit map at finite N between the singlet sector of the free and critical O(N) and U(N) vector models in any spacetime dimension above two\, and a bulk higher spin theory in anti-de Sitter space in one higher dimension. For the boundary theory\, we use the bilocal formalism of Jevicki et al to restrict to the singlet sector of the vector model. The bulk theory is defined from the boundary theory via our mapping\, and is a consistent quantum higher spin theory with a well defined action. Our mapping relates bilocal operators in the boundary theory to higher spin fields in the bulk\, while single trace local operators in the boundary theory are related to boundary values of higher spin fields. We also discuss generalizations of the map to gauge theories\, and at finite temperature.
URL:https://cmsa.fas.harvard.edu/event/derivation-of-ads-cft-for-vector-models/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220921T123000
DTEND;TZID=America/New_York:20220921T133000
DTSTAMP:20240502T145616Z
CREATED:20240214T114047Z
LAST-MODIFIED:20240502T145616Z
UID:10002705-1663763400-1663767000@cmsa.fas.harvard.edu
SUMMARY:Moduli spaces of graphs
DESCRIPTION:Colloquium\n\nSpeaker: Melody Chan\, Brown\n\nTitle: Moduli spaces of graphs\n\nAbstract: A metric graph is a graph—a finite network of vertices and edges—together with a prescription of a positive real length on each edge. I’ll use the term “moduli space of graphs” to refer to certain combinatorial spaces—think simplicial complexes—that furnish parameter spaces for metric graphs. There are different flavors of spaces depending on some additional choices of decorations on the graphs\, but roughly\, each cell parametrizes all possible metrizations of a fixed combinatorial graph. Many flavors of these moduli spaces have been in circulation for a while\, starting with the work of Culler-Vogtmann in the 1980s on Outer Space. They have also recently played an important role in some recent advances using tropical geometry to study the topology of moduli spaces of curves and other related spaces. These advances give me an excuse to give what I hope will be an accessible introduction to moduli spaces of graphs and their connections with geometry.
URL:https://cmsa.fas.harvard.edu/event/collquium-92122/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-09.21.22.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220923T110000
DTEND;TZID=America/New_York:20220923T120000
DTSTAMP:20240301T083553Z
CREATED:20240214T105452Z
LAST-MODIFIED:20240301T083553Z
UID:10002685-1663930800-1663934400@cmsa.fas.harvard.edu
SUMMARY:Random determinants\, the elastic manifold\, and landscape complexity beyond invariance
DESCRIPTION:Member Seminar \nSpeaker: Ben McKenna \nTitle: Random determinants\, the elastic manifold\, and landscape complexity beyond invariance \nAbstract: The Kac-Rice formula allows one to study the complexity of high-dimensional Gaussian random functions (meaning asymptotic counts of critical points) via the determinants of large random matrices. We present new results on determinant asymptotics for non-invariant random matrices\, and use them to compute the (annealed) complexity for several types of landscapes. We focus especially on the elastic manifold\, a classical disordered elastic system studied for example by Fisher (1986) in fixed dimension and by Mézard and Parisi (1992) in the high-dimensional limit. We confirm recent formulas of Fyodorov and Le Doussal (2020) on the model in the Mézard-Parisi setting\, identifying the boundary between simple and glassy phases. Joint work with Gérard Ben Arous and Paul Bourgade.
URL:https://cmsa.fas.harvard.edu/event/member-seminar-title-tba/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220928T123000
DTEND;TZID=America/New_York:20220928T133000
DTSTAMP:20240229T110654Z
CREATED:20230817T172722Z
LAST-MODIFIED:20240229T110654Z
UID:10001265-1664368200-1664371800@cmsa.fas.harvard.edu
SUMMARY:The Tree Property and uncountable cardinals
DESCRIPTION:Colloquium \nSpeaker: Dima Sinapova (Rutgers University) \nTitle: The Tree Property and uncountable cardinals \nAbstract: In the late 19th century Cantor discovered that there are different levels of infinity. More precisely he showed that there is no bijection between the natural numbers and the real numbers\, meaning that the reals are uncountable. He then went on to discover a whole hierarchy of infinite cardinal numbers. It is natural to ask if finitary and countably infinite combinatorial objects have uncountable analogues. It turns out that the answer is yes. \nWe will focus on one such key combinatorial property\, the tree property. A classical result from graph theory (König’s infinity lemma) shows the existence of this property for countable trees. We will discuss what happens in the case of uncountable trees.\n\n 
URL:https://cmsa.fas.harvard.edu/event/collquium-title-tba-2-2/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-09.28.22.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220928T140000
DTEND;TZID=America/New_York:20220928T150000
DTSTAMP:20240214T110335Z
CREATED:20230808T184138Z
LAST-MODIFIED:20240214T110335Z
UID:10001211-1664373600-1664377200@cmsa.fas.harvard.edu
SUMMARY:Statistical mechanics of neural networks: From the geometry of high dimensional error landscapes to beating power law neural scaling
DESCRIPTION:New Technologies in Mathematics \nSpeaker: Surya Ganguli\, Stanford University \n\nTitle: Statistical mechanics of neural networks: From the geometry of high dimensional error landscapes to beating power law neural scaling\n\n\n\n\nAbstract: Statistical mechanics and neural network theory have long enjoyed fruitful interactions.  We will review some of our recent work in this area and then focus on two vignettes. First we will analyze the high dimensional geometry of neural network error landscapes that happen to arise as the classical limit of a dissipative many-body quantum optimizer.  In particular\, we will be able to use the Kac-Rice formula and the replica method to calculate the number\, location\, energy levels\, and Hessian eigenspectra of all critical points of any index.  Second we will review recent work on neural power laws\, which reveal that the error of many neural networks falls off as a power law with network size or dataset size.  Such power laws have motivated significant societal investments in large scale model training and data collection efforts.  Inspired by statistical mechanics calculations\, we show both in theory and in practice how we can beat neural power law scaling with respect to dataset size\, sometimes achieving exponential scaling\, by collecting small carefully curated datasets rather than large random ones.\n\n\n\nReferences: Y. Bahri\, J. Kadmon\, J. Pennington\, S. Schoenholz\, J. Sohl-Dickstein\, and S. Ganguli\, Statistical mechanics of deep learning\, Annual Reviews of Condensed Matter Physics\, 2020.\n\nSorscher\, Ben\, Robert Geirhos\, Shashank Shekhar\, Surya Ganguli\, and Ari S. Morcos. 2022. Beyond Neural Scaling Laws: Beating Power Law Scaling via Data Pruning https://arxiv.org/abs/2206.14486 (NeurIPS 2022).
URL:https://cmsa.fas.harvard.edu/event/8303/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:New Technologies in Mathematics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-NTM-Seminar-09.28.2022.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20220930T110000
DTEND;TZID=America/New_York:20220930T120000
DTSTAMP:20240301T081921Z
CREATED:20240214T105247Z
LAST-MODIFIED:20240301T081921Z
UID:10002683-1664535600-1664539200@cmsa.fas.harvard.edu
SUMMARY:Kahler geometry in twisted materials
DESCRIPTION:Member Seminar \nSpeaker: Jie Wang \nTitle: Kahler geometry in twisted materials \nAbstract: Flatbands are versatile platform for realizing exotic quantum phases due to the enhanced interactions. The canonical example is Landau level where fractional quantum Hall physics exists. Although interaction is strong\, the fractional quantum Hall effect is relatively well understood thanks to its model wavefunction\, exact parent Hamiltonian\, conformal field theory analogous and other exact aspects. In generic flatbands\, the interacting physics is controlled by the interplay between the interaction scale and intrinsic quantum geometries\, in particular the Berry curvature and the Fubini-Study metric\, which are in general spatially non-uniform. It is commonly believed that the non-uniform geometries destroy these exact properties of fractional quantum Hall physics\, making many-body states less stable in flatbands. \nIn this talk\, I will disprove this common belief by showing a large family of flatbands (ideal flatbands) where quantum geometries can be highly non-uniform\, but still exhibit exact properties such as model wavefunctions\, density algebra\, exact parent Hamiltonians. I will discuss both the theory of ideal flatband\, its experimental realization in Dirac materials as well as implications.
URL:https://cmsa.fas.harvard.edu/event/member-seminar-93022/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
END:VEVENT
END:VCALENDAR