BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//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: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:20260304T160000
DTEND;TZID=America/New_York:20260304T170000
DTSTAMP:20260417T024759
CREATED:20260108T200326Z
LAST-MODIFIED:20260316T161023Z
UID:10003868-1772640000-1772643600@cmsa.fas.harvard.edu
SUMMARY:2026 Ding Shum Lecture: Sanjeev Arora\, Princeton
DESCRIPTION:2026 Ding Shum Lecture \nDate: March 4\, 2026 \nTime: 4:00 pm \nLocation: Harvard Science Center Hall D & via Zoom Webinar \nSpeaker: Sanjeev Arora\, Princeton \nTitle: How could a Superhuman AI mathematician come about? \n\nAbstract: Can AI systems exceed the capabilities of the human experts who provided their training data? The talk will examine the hypothesis of AI self‑improvement\, involving mechanisms such as synthetic data generation\, reinforcement learning\, and tool‑augmented reasoning with formal verification loops. \nI will also present recent work at Princeton\, including the Gödel Prover V2 for Lean‑based theorem proving and a new inference pipeline that achieved state‑of‑the‑art performance (at the time of evaluation) on IMO‑ProofBench (Advanced) at moderate inference costs ($20–$30 per problem). These will illustrate how AI systems are sometimes able to escape “cognitive wells”—local optima in a model’s reasoning capabilities. While providing evidence for the feasibility of self‑improvement\, they also highlight important hurdles and open questions. \n\n  \n\n \nSanjeev Arora is Charles C. Fitzmorris Professor of Computer Science and Director of Princeton Language and Intelligence\, a unit devoted to research and applications of large AI models. He got his Phd from UC Berkeley in 1994 and has been a faculty member at Princeton since then. He has been awarded the ACM Prize in Computing (2011)\, Fulkerson Prize in Discrete Mathematics (2012)\, Packard Fellowship\, Sloan Fellowship\, and the ACM Doctoral Dissertation Prize. He was a plenary speaker at the International Congress of Mathematicians in 2018 and is a member of the National Academy of Science and American Academy of Arts and Sciences. \n\n\n\n\n\nThis event is made possible by the generous funding of Ding Lei and Harry Shum.\n\n\n 
URL:https://cmsa.fas.harvard.edu/event/2026_dingshum/
LOCATION:Harvard Science Center\, 1 Oxford Street\, Cambridge\, MA\, 02138
CATEGORIES:Ding Shum Lecture,Event,Public Lecture,Special Lectures
ATTACH;FMTTYPE=image/jpeg:https://cmsa.fas.harvard.edu/media/Ding-Shum-2026_hall-d.jpg
END:VEVENT
END:VCALENDAR