BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.20//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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250203T163000
DTEND;TZID=America/New_York:20250203T173000
DTSTAMP:20260510T172303
CREATED:20240903T194951Z
LAST-MODIFIED:20250130T165403Z
UID:10003434-1738600200-1738603800@cmsa.fas.harvard.edu
SUMMARY:Rational approximation and the AAA algorithm
DESCRIPTION:Colloquium \nSpeaker: Nick Trefethen\, Harvard University \nTitle: Rational approximation and the AAA algorithm \nApproximation by rational functions used to be mainly a theoretical subject\, but with the introduction of the AAA algorithm in 2018\, it became computationally practical and indeed easy. The implications for what we can do numerically are enormous. This talk will outline the algorithm and demonstrate its application to a collection of problems. We can also use it to demonstrate the potential theory that underlies the theory of rational approximation\, a topic that goes back to Joseph Walsh here at Harvard a century ago.
URL:https://cmsa.fas.harvard.edu/event/colloquium-2325/
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-2.3.2025.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20241202T163000
DTEND;TZID=America/New_York:20241202T173000
DTSTAMP:20260510T172303
CREATED:20240903T195308Z
LAST-MODIFIED:20241126T142827Z
UID:10003440-1733157000-1733160600@cmsa.fas.harvard.edu
SUMMARY:Computability on $\mathbb R$ and other continuum-size structures
DESCRIPTION:Colloquium \nSpeaker: Russell Miller\, CUNY \nTitle: Computability on $\mathbb R$ and other continuum-size structures \nAbstract: We begin by recalling the notion of a computable function on the real numbers $\mathbb R$\, developed independently by Gregorczyk and Lacombe over sixty years ago. Using this notion\, we note that the real numbers that are themselves computable form a countable subfield of $\mathbb R$ with exactly the same first-order properties as $\mathbb R$ itself. (Logicians would therefore call it an \emph{elementary subfield}.) So\, in a first-order sense\, everything that happens in $\mathbb R$ is already exemplified in this much nicer subfield. However\, even when one knows that an existential statement holds for all parameters\, it may be impossible (both in $\mathbb R$ and in the subfield) to give a computable procedure for producing witnesses. Similar results hold in $\mathbb C$. \nWe will then turn to a different continuum-sized structure: the absolute Galois group $\operatorname{Gal}(\mathbb Q)$ of the rational numbers. Once again the computable elements of this group form a subgroup\, but now it is an open problem whether the group and the subgroup have the same first-order theory\, let alone whether this is an elementary subgroup. (If they do have the same theory\, this would put nice upper bounds on the complexity of the theory of $\operatorname{Gal}(\mathbb Q)$.) However\, using joint work with Kundu\, we can show that once again there is no computable procedure for producing witnesses to the truth of (true) existential statements\, either in the full group or in the subgroup.
URL:https://cmsa.fas.harvard.edu/event/colloquium-12224/
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-12.2.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20241125T163000
DTEND;TZID=America/New_York:20241125T173000
DTSTAMP:20260510T172303
CREATED:20240903T195237Z
LAST-MODIFIED:20241119T192853Z
UID:10003439-1732552200-1732555800@cmsa.fas.harvard.edu
SUMMARY:Mathematical Structures of Scattering Amplitudes
DESCRIPTION:Colloquium \nSpeaker: Anastasia Volovich\, Brown University \nTitle: Mathematical Structures of Scattering Amplitudes \nAbstract: Planar N=4 Yang-Mills scattering amplitudes have been computed to very high loop order. They have many remarkable properties that have sparked interest from mathematicians working on combinatorics\, algebraic geometry\, and number theory. At the same time\, several methods that have been developed for N=4 Yang-Mills can often be applied to more general quantum field theories\, including QCD. I will overview some of these exciting developments.
URL:https://cmsa.fas.harvard.edu/event/colloquium-112524/
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-11.25.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20241104T163000
DTEND;TZID=America/New_York:20241104T173000
DTSTAMP:20260510T172303
CREATED:20240903T195045Z
LAST-MODIFIED:20241016T202352Z
UID:10003436-1730737800-1730741400@cmsa.fas.harvard.edu
SUMMARY:The mathematics of evolution
DESCRIPTION:Colloquium \nSpeaker: Martin Nowak (Harvard) \nTitle: The mathematics of evolution \nAbstract: All living systems are guided by evolutionary dynamics. Evolution is a search process which occurs in populations of reproducing individuals. The three fundamental forces of evolution are mutation\, selection and cooperation. I will present basic ideas in the mathematical description of evolutionary dynamics\, including quasi-species theory\, evolutionary game theory\, and evolutionary graph theory. I will discuss specific problems such as origin of life\, emergence of complexity\, mechanisms of cooperation\, evolution of cancer and how to overcome resistance to targeted therapy. \n 
URL:https://cmsa.fas.harvard.edu/event/colloquium-11424/
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-11.4.2024.docx.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20241021T163000
DTEND;TZID=America/New_York:20241021T173000
DTSTAMP:20260510T172303
CREATED:20240903T195022Z
LAST-MODIFIED:20241016T144838Z
UID:10003435-1729528200-1729531800@cmsa.fas.harvard.edu
SUMMARY:Higher Vapnik–Chervonenkis theory
DESCRIPTION:Colloquium \nSpeaker: Artem Chernikov\, University of Maryland \nTitle: Higher Vapnik–Chervonenkis theory \nAbstract: Finite VC-dimension\, a combinatorial property of families of sets\, was discovered simultaneously by Vapnik and Chervonenkis in probabilistic learning theory\, and by Shelah in model theory (where it is called NIP). It plays an important role in several areas including machine learning\, combinatorics\, mathematical logic\, functional analysis and topological dynamics. We develop aspects of higher-order VC-theory\, in particular establishing a generalization of the epsilon-net theorem for families of sets (and functions) on n-fold product spaces with bounded VC_n-dimension (i.e. there is a bound on the sizes of n-dimensional boxes that can be shattered). We obtain some applications in combinatorics and in model theory\, including a strong version of Szemerdi’s regularity lemma for hypergraphs omitting a fixed finite n-partite n-hypergraph. Joint work with Henry Towsner.
URL:https://cmsa.fas.harvard.edu/event/colloquium-102124/
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-10.21.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20241007T163000
DTEND;TZID=America/New_York:20241007T173000
DTSTAMP:20260510T172303
CREATED:20240903T194924Z
LAST-MODIFIED:20241003T160128Z
UID:10003433-1728318600-1728322200@cmsa.fas.harvard.edu
SUMMARY:Local complexity measures in modern parameterized function classes for supervised learning
DESCRIPTION:Colloquium \nSpeaker: Elisenda Grigsby\, Boston College \nTitle: Local complexity measures in modern parameterized function classes for supervised learning \nAbstract: The parameter space for any fixed architecture of neural networks serves as a proxy during training for the associated class of functions – but how faithful is this representation? For any fixed feedforward ReLU network architecture\, it is well-known that many different parameter settings can determine the same function. It is less well-known that the degree of this redundancy is inhomogeneous across parameter space. I’ll discuss two locally-applicable complexity measures for ReLU network classes and what we know about the relationship between them: (1) the local functional dimension\, and (2) a local version of VC dimension called persistent pseudodimension. The former is easy to compute on finite batches of points\, the latter should give local bounds on the generalization gap. I’ll speculate about how this circle of ideas might help guide our understanding of the double descent phenomenon. All of the work described in this talk is joint with Kathryn Lindsey. Some portions are also joint with Rob Meyerhoff\, David Rolnick\, and Chenxi Wu.
URL:https://cmsa.fas.harvard.edu/event/colloquium-10724/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=application/pdf:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-10.7.2024.docx.pdf
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240923T163000
DTEND;TZID=America/New_York:20240923T173000
DTSTAMP:20260510T172303
CREATED:20240903T194207Z
LAST-MODIFIED:20240918T190927Z
UID:10003431-1727109000-1727112600@cmsa.fas.harvard.edu
SUMMARY:Symmetry groups in infinite dimensions
DESCRIPTION:Colloquium \nSpeaker: Lisa Carbone\, Rutgers University \nTitle: Symmetry groups in infinite dimensions \nAbstract: The study of many physical theories requires an understanding of symmetries of infinite dimensional Lie algebras. The construction of groups of automorphisms for infinite dimensional Lie algebras is challenging\, but there is well established theory for the class of Kac-Moody algebras. A generalization of Kac-Moody algebras known as Borcherds algebras arise in string theory models\, but the methods for constructing Kac-Moody groups break down for this more general class. We discuss the challenges that arise and describe several approaches to constructing groups for Borcherds algebras. Our main example is the Monster Lie algebra which plays an important role in the solution of Monstrous Moonshine and which is a symmetry algebra of a model of the compactified Heterotic String.
URL:https://cmsa.fas.harvard.edu/event/colloquium-92324/
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.23.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240916T163000
DTEND;TZID=America/New_York:20240916T173000
DTSTAMP:20260510T172303
CREATED:20240903T193540Z
LAST-MODIFIED:20240916T163127Z
UID:10003430-1726504200-1726507800@cmsa.fas.harvard.edu
SUMMARY:Periodic pencils of flat connections and their p-curvature
DESCRIPTION:Colloquium \nSpeaker: Pavel Etingof (MIT) \nTitle: Periodic pencils of flat connections and their p-curvature \n A periodic pencil of flat connections on a smooth algebraic variety  is a linear family of flat connections  \, where  are local coordinates on  and  are matrix-valued regular functions. A pencil is periodic if it is generically invariant under the shifts  up to isomorphism. I will explain that periodic pencils have many remarkable properties\, and there are many interesting examples of them\, e.g. Knizhnik-Zamolodchikov\, Dunkl\, Casimir connections and equivariant quantum connections for conical symplectic resolutions with finitely many torus fixed points. I will also explain that in characteristic \, the -curvature operators  of a periodic pencil  are isospectral to the commuting endomorphisms \, where  is the Frobenius twist of . This allows us to compute the eigenvalues of the -curvature for the above examples\, and also to show that a periodic pencil of connections always has regular singularites. This is joint work with Alexander Varchenko. \n(Abstract link (pdf)
URL:https://cmsa.fas.harvard.edu/event/colloquium_91624/
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.16.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240909T163000
DTEND;TZID=America/New_York:20240909T173000
DTSTAMP:20260510T172303
CREATED:20240827T200454Z
LAST-MODIFIED:20240903T152309Z
UID:10003406-1725899400-1725903000@cmsa.fas.harvard.edu
SUMMARY:Combinatorics and geometry of the amplituhedron
DESCRIPTION:Colloquium \nSpeaker: Lauren Williams\, Harvard University \nTitle: Combinatorics and geometry of the amplituhedron \nAbstract: The amplituhedron is a geometric object introduced by Arkani-Hamed and Trnka to compute scattering amplitudes in N=4 super Yang Mills theory. It generalizes interesting objects such as cyclic polytopes and the positive Grassmannian. It has connections to tropical geometry\, cluster algebras\, and combinatorics (plane partitions\, Catalan numbers). I’ll give a gentle introduction to the amplituhedron\, then survey some recent progress on some of the main conjectures about the amplituhedron: the Magic Number Conjecture\, the BCFW tiling conjecture\, and the Cluster Adjacency conjecture.  Based on joint works withEvan-Zohar\, Lakrec\, Parisi\, Sherman-Bennett\, and Tessler.
URL:https://cmsa.fas.harvard.edu/event/colloquium_9924/
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.09.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240513T163000
DTEND;TZID=America/New_York:20240513T173000
DTSTAMP:20260510T172303
CREATED:20240130T151206Z
LAST-MODIFIED:20240508T203329Z
UID:10000814-1715617800-1715621400@cmsa.fas.harvard.edu
SUMMARY:Errors and Correction in Cumulative Knowledge
DESCRIPTION:Colloquium \nSpeaker: Madhu Sudan\, Harvard University \nTitle: Errors and Correction in Cumulative Knowledge \nAbstract: Societal accumulation of knowledge is a complex\, and arguably error-prone\, process. The correctness of new units of knowledge depends not only on the correctness of the new reasoning\, but also on the correctness of old units that the new one builds on. If left unchecked\, errors could completely ruin the validity of most of this knowledge so there must some error-correcting going on. What are the error-corrections processes employed in nature and how effective are they? In this talk\, we describe our attempts to model such phenomena using probablistic models – we describe models for growth of cumulative knowledge\, emergence of errors and methods to check for errors and eliminate them. We then analyze in this compound model\, when effects of errors may survive\, and when they are totally eliminated. \nThe central discovery in our work is the following optimistic statement: If we do checking correctly (most of the time) investing just a constant factor (<1) of our effort in checking (and saving the remaining constant factor towards deriving new units of knowledge)\, then effects of errors can be kept in check. Notably the amount of effort expended on checking does not scale with the volume of total knowledge or the depth of dependencies in the new units of knowledge\, either of which would be overwhelming. \nBased on the papers: \nIs this correct? Let’s check!\nOmri Ben-Eliezer\, Dan Mikulincer\, Elchanan Mossel\, Madhu Sudan\narXiv:2211.12301 \nErrors are Robustly Tamed in Cumulative Knowledge Processes\nAnna Brandenberger\, Cassandra Marcussen\, Elchanan Mossel\, Madhu Sudan\narXiv:2309.05638
URL:https://cmsa.fas.harvard.edu/event/colloquium-4124/
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-05.13.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240506T163000
DTEND;TZID=America/New_York:20240506T173000
DTSTAMP:20260510T172303
CREATED:20240319T201629Z
LAST-MODIFIED:20240507T201738Z
UID:10000819-1715013000-1715016600@cmsa.fas.harvard.edu
SUMMARY:Liouville Theory and Weil-Petersson Geometry
DESCRIPTION:Colloquium \nSpeaker: Sarah Harrison (Northeastern University) \nTitle: Liouville Theory and Weil-Petersson Geometry \nAbstract: Two-dimensional conformal field theory is a powerful tool to understand the geometry of surfaces. Liouville conformal field theory in the classical (large central charge) limit encodes the geometry of the moduli space of Riemann surfaces. I describe an efficient algorithm to compute the Weil–Petersson metric to arbitrary accuracy using Zamolodchikov’s recursion relation for conformal blocks\, focusing on examples of a sphere with four punctures and generalizations to other one-complex-dimensional moduli spaces. Comparison with analytic results for volumes and geodesic lengths finds excellent agreement. In the case of M_{0\,4}\, I discuss numerical results for eigenvalues of the Weil-Petersson Laplacian and connections with random matrix theory. \nBased on work with K. Coleville\, A. Maloney\, K. Namjou\, and T. Numasawa.
URL:https://cmsa.fas.harvard.edu/event/colloquium-5624/
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-05.06.2024.docx-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240429T163000
DTEND;TZID=America/New_York:20240429T173000
DTSTAMP:20260510T172303
CREATED:20240207T190153Z
LAST-MODIFIED:20240424T142108Z
UID:10000818-1714408200-1714411800@cmsa.fas.harvard.edu
SUMMARY:The DNA of Particle Scattering
DESCRIPTION:Colloquium \nSpeaker: Lance Dixon (SLAC\, Stanford University) \nTitle: The DNA of Particle Scattering \nAbstract: At the Large Hadron Collider\, the copious scattering of quarks and gluons in quantum chromodynamics (QCD) produces Higgs bosons and many backgrounds to searches for new physics.  At short distances\, scattering in QCD can be evaluated in perturbation theory and leads to highly intricate\, multivariate mathematical functions such as generalized polylogarithms.  To gain further insight\, one can study a cousin of QCD called planar N=4 super-Yang-Mills theory.  Some processes in this theory can be computed to eighth order in perturbation theory\, versus second or third order in QCD.  The computation and analysis of these results rely on a Hopf algebra coaction on polylogarithms.  Its maximal iteration is called the ‘symbol’\, which serves as a ‘genetic code’ for amplitudes.  The symbol is a linear combination of words\, sequences of letters analogous to sequences of DNA base pairs.  Understanding the alphabet\, and then reading the code\, exposes the physics and mathematics of quantum scattering\, including bizarre new symmetries.  For example\, the two scattering amplitudes that are known to the highest orders in perturbation theory (8 loops) are related to each other by an ‘antipodal duality’\, which involves reading the code backwards as well as forwards. A third scattering amplitude\, which contains the other two as limits\, has an antipodal self-duality which ‘explains’ the other duality.  However\, we still don’t know ‘who ordered’ this property\, or what it really means. \n 
URL:https://cmsa.fas.harvard.edu/event/colloquium-42924/
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-04.29.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240318T163000
DTEND;TZID=America/New_York:20240318T173000
DTSTAMP:20260510T172303
CREATED:20240130T151005Z
LAST-MODIFIED:20240308T200603Z
UID:10000812-1710779400-1710783000@cmsa.fas.harvard.edu
SUMMARY:Koszul duality & twisted holography for asymptotically flat spacetimes
DESCRIPTION:Colloquium \nSpeaker: Natalie Paquette\, University of Washington \nTitle: Koszul duality & twisted holography for asymptotically flat spacetimes \nAbstract: Koszul duality has been understood in recent years to characterize order-type defects in twists of supersymmetric field theories. This notion has been generalized\, from a physical point of view\, by studying couplings between D-branes and closed string theories in the topological string. Computing the D-brane backreaction\, and studying the resulting open/closed string duality\, is the purview of the twisted holography program. Twisted holography seeks to study supersymmetric sectors of the AdS/CFT correspondence using these methods\, and leverage the appropriate generalization of Koszul duality to elucidate the bulk/boundary map. When applying these methods to a topological string configuration on twistor space\, one can construct an instance of twisted holography in which a 2d chiral algebra\, supported on the “celestial sphere”\, is dual to a 4d theory in an asymptotically flat spacetime. This is the first such top-down example of holography in a 4d asymptotically flat spacetime. This talk describes joint work done\, variously\, with Kevin Costello\, Brian Williams\, and Atul Sharma.
URL:https://cmsa.fas.harvard.edu/event/colloquium-31824/
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-03.18.2024.docx-2_Page_1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240304T163000
DTEND;TZID=America/New_York:20240304T173000
DTSTAMP:20260510T172303
CREATED:20240130T150912Z
LAST-MODIFIED:20240228T213450Z
UID:10000810-1709569800-1709573400@cmsa.fas.harvard.edu
SUMMARY:Strong bounds for arithmetic progressions
DESCRIPTION:Colloquium \nSpeaker: Raghu Meka (UCLA) \nTitle: Strong bounds for arithmetic progressions \nAbstract: Suppose you have a set S of integers from {1\,2\,…\,N} that contains at least N / C elements. Then for large enough N\, must S contain three equally spaced numbers (i.e.\, a 3-term arithmetic progression)? \nIn 1953\, Roth showed this is the case when C is roughly (log log N). Behrend in 1946 showed that C can be at most exp(sqrt(log N)). Since then\, the problem has been a cornerstone of the area of additive combinatorics. Following a series of remarkable results\, a celebrated paper from 2020 due to Bloom and Sisask improved the lower bound on C to C = (log N)^(1+c) for some constant c > 0. \nThis talk will describe a new work showing that C can be much closer to Behrend’s construction. Based on joint work with Zander Kelley.
URL:https://cmsa.fas.harvard.edu/event/colloquium-3424/
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-03.04.2024-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240226T163000
DTEND;TZID=America/New_York:20240226T173000
DTSTAMP:20260510T172303
CREATED:20240130T150524Z
LAST-MODIFIED:20240220T171315Z
UID:10000809-1708965000-1708968600@cmsa.fas.harvard.edu
SUMMARY:Factorization algebras in quite a lot of generality
DESCRIPTION:Colloquium \nSpeaker: Clark Barwick\, University of Edinburgh \nTitle: Factorization algebras in quite a lot of generality \nAbstract: The objects of arithmetic geometry are not manifolds. Some concepts from differential geometry admit analogues in arithmetic\, but they are not straightforward. How then can we hope to make precise sense of quantum field theories on these objects? I will propose the beginnings of a mathematical framework via a general theory of factorization algebras. A new feature is a subtle piece of additional structure on our objects – what I call a world-structure – that is ordinarily left implicit.
URL:https://cmsa.fas.harvard.edu/event/colloquium-22624/
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-02.26.2024.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240212T163000
DTEND;TZID=America/New_York:20240212T173000
DTSTAMP:20260510T172303
CREATED:20240201T145702Z
LAST-MODIFIED:20240209T210827Z
UID:10000807-1707755400-1707759000@cmsa.fas.harvard.edu
SUMMARY:Machine Learning and Scientific Computing: There is plenty of room in the middle
DESCRIPTION:Colloquium \nSpeaker: Petros Koumoutsakos\, Harvard SEAS \nTitle: Machine Learning and Scientific Computing: There is plenty of room in the middle \nAbstract: Over the last thirty years we have experienced more than a billion-fold increase in hardware capabilities and a dizzying pace of acquiring and transmitting massive amounts of data. Scientific Computing and\, more lately\, Artificial Intelligence (AI) has been key beneficiaries of these advances. In this talk I would outline the need for bridging the decades long advances in Scientific Computing with those of AI. I will use examples from fluid mechanics to argue for forming alloys of AI and simulations for their prediction and control. I will present novel algorithms for learning the Effective Dynamics (LED) of complex systems and a fusion of multi- agent reinforcement learning and scientific computing (SciMARL) for modeling and control of turbulent flows. I will also show our recent work on Optimizing a Discrete Loss (ODIL) that outperforms popular techniques such as PINNs by several orders of magnitude. \nI will juxtapose successes and failures and argue that the proper fusion of scientific computing and AI expertise are essential to advance scientific frontiers. \n 
URL:https://cmsa.fas.harvard.edu/event/colloquium-21224/
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-02.12.2024_Page_1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231211T163000
DTEND;TZID=America/New_York:20231211T173000
DTSTAMP:20260510T172303
CREATED:20240223T074431Z
LAST-MODIFIED:20240223T074431Z
UID:10002828-1702312200-1702315800@cmsa.fas.harvard.edu
SUMMARY:Homology\, higher derived limits\, and set theory
DESCRIPTION:Colloquium \nSpeaker: Justin Moore (Cornell University) \nTitle: Homology\, higher derived limits\, and set theory \nAbstract: Singular homology has a number of well-known defects when used to study spaces such as the Hawaiian earring and solenoids. It may not reflect the “shape” of the space and can give counterintuitive information about its dimension. One remedy of this is to develop a homology theory based on approximating spaces by polyhedra\, computing their homologies\, and then taking a limit. This is the approach taken by Steenrod-Sitnikov homology and Lisica and Mardesic’s strong homology. Even within the class of locally compact second countable spaces though\, the properties of these homology theories — and the higher derived limits which underly them — are dependent on axioms of set theory beyond ZFC. Recently it was shown that it is consistent with (and therefore independent of) ZFC that strong homology and Steenrod Sitnikov homology coincide in the class of locally compact second countable spaces — and therefore each of these homology theories enjoys the desirable properties of the other. These results also point to how we might develop variants of these homology theories which enjoy their desirable properties\, but which are less sensitive to set theory. This is joint work with Nathaniel Bannister\, Jeff Bergfalk\, and Stevo Todorcevic.
URL:https://cmsa.fas.harvard.edu/event/colloquium-121123/
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-12.11.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231204T163000
DTEND;TZID=America/New_York:20231204T173000
DTSTAMP:20260510T172303
CREATED:20240223T075301Z
LAST-MODIFIED:20240223T075301Z
UID:10002830-1701707400-1701711000@cmsa.fas.harvard.edu
SUMMARY:Analysis of ALH* gravitational instantons
DESCRIPTION:Speaker: Xuwen Zhu (Northeastern) \nTitle: Analysis of ALH* gravitational instantons \nAbstract: Gravitational instantons are non-compact Calabi-Yau metrics with L^2 bounded curvature and are categorized into six types. We will discuss one such type called ALH* metrics which has a non-compact end modelled by the Calabi ansatz with inhomogeneous collapsing near infinity. Such metrics appeared recently in the works on SYZ conjecture\, as well as the scaling bubble limits for codimension-3 collapsing of K3 surfaces\, where the study of its Laplacian played a central role. In this talk I will talk about the Fredholm mapping property and L^2 cohomology of such metrics. This is ongoing work joint with Rafe Mazzeo.
URL:https://cmsa.fas.harvard.edu/event/colloquium-12423/
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-12.04.2023.docx-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231127T163000
DTEND;TZID=America/New_York:20231127T173000
DTSTAMP:20260510T172303
CREATED:20240223T080018Z
LAST-MODIFIED:20240223T080018Z
UID:10002831-1701102600-1701106200@cmsa.fas.harvard.edu
SUMMARY:What do topological dynamics\, combinatorics\, and model theory have in common?
DESCRIPTION:Speaker: Dana Bartosova (University of Florida) \nTitle: What do topological dynamics\, combinatorics\, and model theory have in common? \nAbstract: A striking correspondence between dynamics of automorphism groups of countable first order structures and Ramsey theory of finitary approximation of the structures was established in 2005 by Kechris\, Pestov\, and Todocevic. Since then\, their work has been generalized and applied in many directions. It also struck a fresh wave of interest in finite Ramsey theory.  Many classes of finite structures are shown to have the Ramsey property by encoding their problem in a known Ramsey class and translating a solution back. This is often a case-by-case approach and naturally there is a great need for abstracting the process. There has been much success on this front\, however\, none of the tools captures every situation. We will discuss one such encoding via a model-theoretic notion of semi-retraction introduced by Lynn Scow in 2012. In a joint work\, we showed that a semi-retraction transfers the Ramsey property from one class of structures to another under quite general conditions. We compare semi-retractions to a category-theoretical notion of pre-adjunction revived by Mašulović in 2016. If time permits\, I will mention a transfer theorem of the Ramsey property from a class of finite structures to their uncountable ultraproducts\, which is an AIMSQuaRE project with Džamonja\, Patel\, and Scow.
URL:https://cmsa.fas.harvard.edu/event/colloquium-112723/
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-11.27.2023_Page_1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231120T163000
DTEND;TZID=America/New_York:20231120T173000
DTSTAMP:20260510T172303
CREATED:20240223T080617Z
LAST-MODIFIED:20240223T080617Z
UID:10002833-1700497800-1700501400@cmsa.fas.harvard.edu
SUMMARY:The analytical challenges of connectomics
DESCRIPTION:Speaker: Jeff W. Lichtman (Harvard University) \nTitle: The analytical challenges of connectomics \nAbstract: Recent progress in generating synapse-level maps of brains\, a field known as connectomics\, brings both opportunities and challenges. The upside is that the biophysical instantiation of memories\, behaviors\, and knowledge will soon be before us. The downside is that no one knows exactly how to make sense of this data. I will show what connectomics data sets are and attempt to explain why it is so difficult to unravel their meaning.
URL:https://cmsa.fas.harvard.edu/event/colloquium-112023/
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-11.20.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231113T163000
DTEND;TZID=America/New_York:20231113T173000
DTSTAMP:20260510T172303
CREATED:20240223T081522Z
LAST-MODIFIED:20240223T081522Z
UID:10002834-1699893000-1699896600@cmsa.fas.harvard.edu
SUMMARY:Koszul duality in QFT
DESCRIPTION:Speaker: Brian Williams (Boston University) \nTitle: Koszul duality in QFT \nAbstract: We will describe appearances of the algebraic phenomena of Koszul duality in the context of boundary conditions and defects in quantum field theory. Primarily motivated by topological string theory\, this point of view was pioneered by Costello and Li in their proposal for a twisted version of the AdS/CFT correspondence. Since then\, many important examples of (twisted) holographic dualities in string and M-theory have been studied in work of Costello\, Gaiotto\, Paquette and many others. I will survey some of these examples and some current work with Raghavendran and Saberi which uses this formalism to predict exceptional symmetries present in M-theory. \n 
URL:https://cmsa.fas.harvard.edu/event/colloquium-111323/
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-11.13.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231106T163000
DTEND;TZID=America/New_York:20231106T173000
DTSTAMP:20260510T172303
CREATED:20240223T083208Z
LAST-MODIFIED:20240223T083208Z
UID:10002838-1699288200-1699291800@cmsa.fas.harvard.edu
SUMMARY:Impossibility results in classical dynamical systems
DESCRIPTION:Speaker: Matthew Foreman (UC Irvine) \nTitle: Impossibility results in classical dynamical systems \nAbstract: In 1932\, motivated by questions in statistical and celestial mechanics\, von Neumann proposed classifying the statistical behavior of dynamical systems. In the 1960’s\, motivated by work of Poincaré\, Smale proposed classifying the qualitative behavior of dynamical systems.  These questions laid the groundwork for enormous amounts of work\, but the fundamental questions remain open. This talk shows that they are impossible to answer in a rigorous sense. The talk will discuss various kinds of impossibility results and describe how they apply to von Neumann’s program and Smale’s program. \n 
URL:https://cmsa.fas.harvard.edu/event/colloquium-11623/
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-11.06.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231030T163000
DTEND;TZID=America/New_York:20231030T173000
DTSTAMP:20260510T172303
CREATED:20240223T084547Z
LAST-MODIFIED:20240223T084547Z
UID:10002840-1698683400-1698687000@cmsa.fas.harvard.edu
SUMMARY:Homotopy categories of rings: some properties and consequences in module categories
DESCRIPTION:Speaker: Manuel Cortés-Izurdiaga (University of Malaga) \nTitle:  Homotopy categories of rings: some properties and consequences in module categories \nAbstract: Given a non-necessarily commutative ring with unit and an additive subcategory of the category of right modules\, one can consider complexes of modules in the subcategory and the corresponding homotopy category. Sometimes\, these homotopy categories are the first step in studying other (algebraic) homotopy categories\, such as those associated to a scheme. To study these categories\, one can use results from the category of modules or the category of complexes. In the first part of the talk\, we will see how some results of homotopy categories of complexes extend to homotopy categories of N-complexes\, for a natural number N greater than or equal to 2\, using some techniques from module categories\, such us the deconstruction of a class of modules. \nAnother approximation is to use other methods for studying homotopy categories\, like those coming from triangulated categories. In some cases\, the results obtained in homotopy categories imply some consequences in the category of modules. In the second part of the talk\, we will see how to prove the existence of Gorenstein-projective precovers for some specific rings using this approach.
URL:https://cmsa.fas.harvard.edu/event/colloquium-103023/
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-10.30.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231023T163000
DTEND;TZID=America/New_York:20231023T173000
DTSTAMP:20260510T172303
CREATED:20240223T092904Z
LAST-MODIFIED:20240223T092904Z
UID:10002843-1698078600-1698082200@cmsa.fas.harvard.edu
SUMMARY: On Provable Copyright Protection for Generative Model
DESCRIPTION:Speaker: Boaz Barak (Harvard) \nTitle: On Provable Copyright Protection for Generative Model \nAbstract: There is a growing concern that learned conditional generative models may output samples that are substantially similar to some copyrighted data C that was in their training set. We give a formal definition of near access-freeness (NAF) and prove bounds on the probability that a model satisfying this definition outputs a sample similar to C\, even if C is included in its training set. \nRoughly speaking\, a generative model p is k-NAF if for every potentially copyrighted data C\, the output of p diverges by at most k-bits from the output of a model q that did not access C at all. We also give generative model learning algorithms\, which efficiently modify the original generative model learning algorithm in a black box manner\, that output generative models with strong bounds on the probability of sampling protected content. Furthermore\, we provide promising experiments for both language (transformers) and image (diffusion) generative models\, showing minimal degradation in output quality while ensuring strong protections against sampling protected content. \nJoint work with Nikhil Vyas and Sham Kakade. Paper appeared in ICML 2023 and is on https://arxiv.org/abs/2302.10870
URL:https://cmsa.fas.harvard.edu/event/colloquium-102323/
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-10.23.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231016T163000
DTEND;TZID=America/New_York:20231016T173000
DTSTAMP:20260510T172303
CREATED:20240223T093426Z
LAST-MODIFIED:20251026T063911Z
UID:10002844-1697473800-1697477400@cmsa.fas.harvard.edu
SUMMARY:An exploration of infinite games—infinite Wordle and the Mastermind numbers
DESCRIPTION:Speaker: Joel D. Hamkins (Notre Dame and Oxford) \nTitle: An exploration of infinite games—infinite Wordle and the Mastermind numbers \nAbstract: Let us explore the nature of strategic reasoning in infinite games\, focusing on the cases of infinite Wordle and infinite Mastermind. The familiar game of Wordle extends naturally to longer words or even infinite words in an idealized language\, and Mastermind similarly has natural infinitary analogues. What is the nature of play in these infinite games? Can the codebreaker play so as to win always at a finite stage of play? The analysis emerges gradually\, and in the talk I shall begin slowly with some easy elementary observations. By the end\, however\, we shall engage with sophisticated ideas in descriptive set theory\, a kind of infinitary information theory. Some assertions about the minimal size of winning sets of guesses\, for example\, turn out to be independent of the Zermelo-Fraenkel ZFC axioms of set theory. Some questions remain open.
URL:https://cmsa.fas.harvard.edu/event/colloquium-101623/
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-10.16.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231002T163000
DTEND;TZID=America/New_York:20231002T173000
DTSTAMP:20260510T172303
CREATED:20240227T095159Z
LAST-MODIFIED:20240227T095159Z
UID:10002874-1696264200-1696267800@cmsa.fas.harvard.edu
SUMMARY:Gravitational Instantons
DESCRIPTION:Speaker: Yu-Shen Lin (Boston University) \nTitle: Gravitational Instantons \nAbstract: Gravitational instantons were introduced by Hawking as building blocks of his Euclidean quantum gravity theory back in the 1970s. These are non-compact Calabi-Yau surfaces with L2 curvature and thus can be viewed as the non-compact analogue of K3 surfaces. K3 surfaces are 2-dimensional Calabi-Yau manifolds and are usually the testing stone before conquering the general Calabi-Yau problems. The moduli space of K3 surfaces and its compactification on their own form important problems in various branches in geometry. In this talk\, we will discuss the Torelli theorem of gravitational instantons\, how the cohomological invariants of a gravitational instanton determine them. As a consequence\, this leads to a description of the moduli space of gravitational instantons.
URL:https://cmsa.fas.harvard.edu/event/colloquium-10223/
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-10.02.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230503T123000
DTEND;TZID=America/New_York:20230503T133000
DTSTAMP:20260510T172303
CREATED:20230817T183740Z
LAST-MODIFIED:20240216T085646Z
UID:10001284-1683117000-1683120600@cmsa.fas.harvard.edu
SUMMARY:Generative Adversarial Networks (GANs): An Analytical Perspective
DESCRIPTION:Speaker: Xin Guo\, UC Berkeley \nTitle: Generative Adversarial Networks (GANs): An Analytical Perspective \nAbstract: Generative models have attracted intense interests recently. In this talk\, I will discuss one class of generative models\, Generative Adversarial Networks (GANs).  I will first provide a gentle review of the mathematical framework behind GANs. I will then proceed to discuss a few challenges in GANs training from an analytical perspective. I will finally report some recent progress for GANs training in terms of its stability and convergence analysis. \n 
URL:https://cmsa.fas.harvard.edu/event/collquium-5323/
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-05.03.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230426T123000
DTEND;TZID=America/New_York:20230426T133000
DTSTAMP:20260510T172303
CREATED:20230817T183259Z
LAST-MODIFIED:20240122T053311Z
UID:10001283-1682512200-1682515800@cmsa.fas.harvard.edu
SUMMARY:Boundary behavior at classical and quantum phase transitions
DESCRIPTION:Speaker: Max Metlitski (MIT) \nTitle: Boundary behavior at classical and quantum phase transitions \nAbstract: There has been a lot of recent interest in the boundary behavior of materials. This interest is driven in part by the field of topological states of quantum matter\, where exotic protected boundary states are ubiquitous. In this talk\, I’ll ask: what happens at a boundary of a system\, when the bulk goes through a phase transition. While this question was studied in the context of classical statistical mechanics in the 70s and 80s\, basic aspects of the boundary phase diagram for the simplest classical phase transitions have been missed until recently. I’ll describe progress in this field\, as well as some extensions to quantum phase transitions. \n 
URL:https://cmsa.fas.harvard.edu/event/collquium-42623/
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-04.26.2023.rev2_.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230420T133000
DTEND;TZID=America/New_York:20230420T143000
DTSTAMP:20260510T172303
CREATED:20230817T182708Z
LAST-MODIFIED:20240216T085423Z
UID:10001282-1681997400-1682001000@cmsa.fas.harvard.edu
SUMMARY:Black hole collider physics
DESCRIPTION:Speaker: Julio Parra Martinez\, Caltech \nTitle: Black hole collider physics \nAbstract: Despite more than a century since the development of Einstein’s theory\, the general relativistic two-body problem remains unsolved. A precise description of its solution is now essential\, as it is necessary for understanding the strong-gravity dynamics of compact binaries observed at LIGO/VIRGO/KAGRA and in future gravitational wave observatories. In this talk\, I will describe how considering the scattering of black holes and gravitons can shed new light on this problem. I will explain how using modern ideas from collider and particle physics we can calculate scattering observables in classical gravity\, and extract the basic ingredients that describe the bound binary dynamics. Such calculations have produced state-of-art predictions for current and future gravitational wave observatories\, which open the door for further discovery as we enter this new era of precision gravitational physics.
URL:https://cmsa.fas.harvard.edu/event/collquium-42023/
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-04.20.2023.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230412T123000
DTEND;TZID=America/New_York:20230412T133000
DTSTAMP:20260510T172303
CREATED:20230817T182227Z
LAST-MODIFIED:20240215T103145Z
UID:10001281-1681302600-1681306200@cmsa.fas.harvard.edu
SUMMARY:Unexpected Uses of Neural Networks: Field Theory and Metric Flows  
DESCRIPTION:Speaker: James Halverson (Northeastern University)\n \nTitle: Unexpected Uses of Neural Networks: Field Theory and Metric Flows\nAbstract:  We are now quite used to the idea that deep neural networks may be trained in a variety of ways to tackle cutting-edge problems in physics and mathematics\, sometimes leading to rigorous results. In this talk\, however\, I will argue that breakthroughs in deep learning theory are also useful for making progress\, focusing on applications to field theory and metric flows. Specifically\, I will introduce a neural network approach to field theory with a different statistical origin\, that exhibits generalized free field behavior at infinite width and interactions at finite width\, and that allows for the study of symmetries via the study of correlation functions in a different duality frame. Then\, I will review recent progress in approximating Calabi-Yau metrics as neural networks and cast that story into the language of neural tangent kernel theory\, yielding a theoretical understanding of neural network metric flows induced by gradient descent and recovering famous metric flows\, such as Perelman’s formulation of Ricci flow\, in particular limits.
URL:https://cmsa.fas.harvard.edu/event/colloquium12523/
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/02CMSA-Colloquium-04.12.2023.png
END:VEVENT
END:VCALENDAR