BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.20//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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20270314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20271107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260506T140000
DTEND;TZID=America/New_York:20260506T150000
DTSTAMP:20260506T180759
CREATED:20260421T144955Z
LAST-MODIFIED:20260421T150144Z
UID:10003935-1778076000-1778079600@cmsa.fas.harvard.edu
SUMMARY:New directions in synthetic data
DESCRIPTION:New Technologies in Mathematics Seminar \nSpeaker: Tatsunori Hashimoto\, Stanford \nTitle: New directions in synthetic data \nAbstract: Synthetic data has been an effective\, if boring set of techniques: prompt some language model to restructure your corpus to match some downstream task\, with occasionally some distillation. In this talk\, we will take a more expansive view of synthetic data as a general algorithmic tool for generative modeling\, arguing that the design space and possibilities of synthetic data are much bigger than it might seem. Through a few recent works\, we will show that synthetic data has major benefits beyond transforming the data – improving in-domain perplexities\, and enabling unique algorithmic primitives\, such as neighborhood smoothing and concatenated ‘mega’ documents. With this broader view\, we will point towards a nascent but interesting possibility of treating data itself as an algorithmic object to be engineered and optimized end-to-end. \n 
URL:https://cmsa.fas.harvard.edu/event/newtech_5626/
LOCATION:Virtual
CATEGORIES:New Technologies in Mathematics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-NTM-Seminar-5.6.2026.docx.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260508T120000
DTEND;TZID=America/New_York:20260508T130000
DTSTAMP:20260506T180759
CREATED:20260506T194023Z
LAST-MODIFIED:20260506T203007Z
UID:10003943-1778241600-1778245200@cmsa.fas.harvard.edu
SUMMARY:From Poincaré/Koszul duality to (twisted) AdS/CFT correspondence
DESCRIPTION:Member Seminar \nSpeaker: Keyou Zeng \nTitle: From Poincaré/Koszul duality to (twisted) AdS/CFT correspondence \nAbstract: Poincaré duality is a fundamental result in the (co)homology theory of manifolds. It has many applications in topology and vast generalizations to other types of “spaces\,” such as singular/stratified spaces and schemes. In this talk\, I will discuss a variant of Poincaré duality for factorization algebras\, also known as Koszul duality. At the end of the talk\, I will relate this notion to a mathematical formulation of what physicists call the AdS/CFT correspondence\, as proposed by Costello and Li. \n 
URL:https://cmsa.fas.harvard.edu/event/member-seminar-5826/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Member-Seminar-5.8.26.1.docx-scaled.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260511T150000
DTEND;TZID=America/New_York:20260511T160000
DTSTAMP:20260506T180759
CREATED:20260409T140454Z
LAST-MODIFIED:20260506T201809Z
UID:10003931-1778511600-1778515200@cmsa.fas.harvard.edu
SUMMARY:When do anomalous finite symmetries in (3+1)d enforce gaplessness?
DESCRIPTION:Quantum Field Theory and Physical Mathematics Seminar \nSpeaker: Matthew Yu (University of Oxford) \nTitle: When do anomalous finite symmetries in (3+1)d enforce gaplessness? \nAbstract: I will explain a comprehensive framework for characterizing the infrared (IR) phases of a fermionic QFTs in (3+1)d\, based on their quantum anomalies associated with a finite symmetry. We uncover a fundamental dichotomy among these anomalies: the first class of anomalies can always be realized by symmetric gapped states\, while the second class can never be realized by gapped states without breaking the given symmetry\, establishing the phenomenon of symmetry-enforced gaplessness in these settings. Using the construction of symmetry extension afforded to us by new developments in fusion 2-categories\, we construct the candidate gapped states that theories with the first class of anomalies can flow to in the IR. As an application\, I will provide examples of concrete predictions for the candidate IR phases of (3+1)d gauge theories based on our results. \n 
URL:https://cmsa.fas.harvard.edu/event/qft_51126/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Quantum Field Theory and Physical Mathematics
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-QFT-and-Physical-Mathematics-5.11.26.docx-1-scaled.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260511T163000
DTEND;TZID=America/New_York:20260511T173000
DTSTAMP:20260506T180759
CREATED:20251223T190403Z
LAST-MODIFIED:20260409T200727Z
UID:10003848-1778517000-1778520600@cmsa.fas.harvard.edu
SUMMARY:Statistical Shape Analysis of Complex Natural Structures
DESCRIPTION:Colloquium \nSpeaker: Anuj Srivastava\, Johns Hopkins University \nTitle: Statistical Shape Analysis of Complex Natural Structures \nAbstract: Statistical modeling and analysis of structured data is a fast-growing field in Statistics and Data Science. Rapid advances in imaging techniques have led to tremendous amounts of data for analyzing imaged objects across several scientific disciplines. Examples include shapes of cancer cells\, botanical trees\, human biometrics\, 3D genome\, brain anatomical structures\, crowd videos\, nano-manufacturing\, and so on. Shapes are relevant even in non-imaging data contexts\, e.g.\, the shapes of COVID rate curves or the shapes of activity cycles in lifestyle data. Imposing statistical models and inferences on shapes seems daunting because the shape is an abstract notion and one requires precise mathematical representations to quantify shapes. This talk has two parts. In the first part\, I will present some recent developments in “elastic representations” of structures such as functions\, curves\, surfaces\, and graphs. In the second part\, I will focus on statistical analyses: computing shape summaries\, estimation under shape constraints\, hypothesis testing\, time-series models\, and regression models involving shapes. \n 
URL:https://cmsa.fas.harvard.edu/event/colloquium-51126/
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-5.11.2026.docx.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260514T160000
DTEND;TZID=America/New_York:20260514T170000
DTSTAMP:20260506T180759
CREATED:20260330T154547Z
LAST-MODIFIED:20260502T220412Z
UID:10003926-1778774400-1778778000@cmsa.fas.harvard.edu
SUMMARY:Polynomial invariants of conjugation over finite fields
DESCRIPTION:Algebra Seminar \nSpeaker: Aryaman Maithani\, University of Utah \nTitle: Polynomial invariants of conjugation over finite fields\n\nAbstract: Consider the conjugation action of GL₂(K) on the polynomial ring K[X₂ₓ₂].\nWhen K is an infinite field\, the ring of invariants is a polynomial ring generated by the trace and the determinant.\nWe describe the ring of invariants when K is a finite field\, and show that it is a hypersurface.\n  \n 
URL:https://cmsa.fas.harvard.edu/event/algebra-seminar_51426/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Algebra Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Algebra-Seminar-5.14.26.2.docx-scaled.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260518T150000
DTEND;TZID=America/New_York:20260518T160000
DTSTAMP:20260506T180759
CREATED:20260413T151244Z
LAST-MODIFIED:20260413T151244Z
UID:10003933-1779116400-1779120000@cmsa.fas.harvard.edu
SUMMARY:Quantum Field Theory and Physical Mathematics
DESCRIPTION:Quantum Field Theory and Physical Mathematics Seminar \n 
URL:https://cmsa.fas.harvard.edu/event/qft_51826/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Quantum Field Theory and Physical Mathematics
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20260520T140000
DTEND;TZID=America/New_York:20260520T150000
DTSTAMP:20260506T180759
CREATED:20260429T133019Z
LAST-MODIFIED:20260429T143145Z
UID:10003942-1779285600-1779289200@cmsa.fas.harvard.edu
SUMMARY:Separation of timescales controls feature learning and overfitting in large neural networks
DESCRIPTION:New Technologies in Mathematics Seminar \nSpeaker: Pierfrancesco Urbani\, Universite Paris-Saclay\, CNRS\, CEA\, Institut de physique theorique \nTitle: Separation of timescales controls feature learning and overfitting in large neural networks \nAbstract: To understand the inductive bias and generalization capabilities of large\, overparameterized machine learning models\, it is essential to analyze the dynamics of their training algorithms. Using dynamical mean field theory we investigate the learning dynamics of large two-layer neural networks. Our findings reveal that\, for networks with a large width\, the training process exhibits a separation of timescales phenomenon. This leads to several key observations:\n1. The emergence of a slow timescale linked to the growth in Gaussian/Rademacher complexity of the network;\n2. An inductive bias favoring low complexity when the initial model complexity is sufficiently small;\n3. A dynamical decoupling between feature learning and overfitting phases;\n4. A non-monotonic trend in test error\, characterized by a “feature unlearning” regime at later stages of training.\nJoint work with Andrea Montanari. \n  \n 
URL:https://cmsa.fas.harvard.edu/event/newtech_52026/
LOCATION:Virtual
CATEGORIES:New Technologies in Mathematics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-NTM-Seminar-5.20.2026.docx.png
END:VEVENT
END:VCALENDAR