BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.16.3//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: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:VEVENT
DTSTART;TZID=America/New_York:20250409T120000
DTEND;TZID=America/New_York:20250409T130000
DTSTAMP:20260623T213503
CREATED:20250306T143004Z
LAST-MODIFIED:20250306T152429Z
UID:10003718-1744200000-1744203600@cmsa.fas.harvard.edu
SUMMARY:CMSA Q&A Seminar: Eric Maskin
DESCRIPTION:CMSA Q&A Seminar \nSpeaker: Eric Maskin\, Harvard University \nTopic: The Mathematics of Voting
URL:https://cmsa.fas.harvard.edu/event/cmsaqa_4925/
LOCATION:Common Room\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:CMSA Q&A Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Q-A-Seminar-4.9.2025.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250409T140000
DTEND;TZID=America/New_York:20250409T150000
DTSTAMP:20260623T213503
CREATED:20250128T214458Z
LAST-MODIFIED:20250410T150618Z
UID:10003707-1744207200-1744210800@cmsa.fas.harvard.edu
SUMMARY:Can Transformers Do Enumerative Geometry?
DESCRIPTION:New Technologies in Mathematics Seminar \nSpeaker: Baran Hashemi\, Technical University of Munich \nTitle: Can Transformers Do Enumerative Geometry? \nAbstract: How can Transformers model and learn enumerative geometry? What is a systematic procedure for using Transformers in abductive knowledge discovery within a mathematician-machine collaboration? In this work\, we introduce a Neural Enumerative Reasoning model for computation of ψ-class intersection numbers on the moduli space of curves. By reformulating the problem as a continuous optimization task\, we compute intersection numbers across a wide value range from 10e-45 to 10e45. To capture the recursive nature inherent in these intersection numbers\, we propose the Dynamic Range Activator (DRA)\, a new activation function that enhances the Transformer’s ability to model recursive patterns and handle severe heteroscedasticity. Given precision requirements for computing the intersections\, we quantify the uncertainty of the predictions using Conformal Prediction with a dynamic sliding window adaptive to the partitions of equivalent number of marked points. Beyond simply computing intersection numbers\, we explore the enumerative “world-model” of Transformers. Our interpretability analysis reveals that the network is implicitly modeling the Virasoro constraints in a purely data-driven manner. Moreover\, through abductive hypothesis testing\, probing\, and causal inference\, we uncover evidence of an emergent internal representation of the large-genus asymptotic of ψ-class intersection numbers. This opens up new possibilities in inferring asymptotic closed-form expressions directly from limited amount of data. \nThis talk is based on https://openreview.net/pdf?id=4X9RpKH4Ls. \n 
URL:https://cmsa.fas.harvard.edu/event/newtech_4925/
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-4.9.2025.png
END:VEVENT
END:VCALENDAR