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: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:20250212T120000
DTEND;TZID=America/New_York:20250212T130000
DTSTAMP:20260410T141214
CREATED:20241104T145634Z
LAST-MODIFIED:20250131T154821Z
UID:10003534-1739361600-1739365200@cmsa.fas.harvard.edu
SUMMARY:CMSA Q&A Seminar: Javier Gomez-Serrano
DESCRIPTION:CMSA Q&A Seminar \nSpeaker: Javier Gomez-Serrano\, Brown University \nTopic: Please tell us about the Millennium prize problem for Navier-Stokes and segue from that into ML?
URL:https://cmsa.fas.harvard.edu/event/cmsaqa_21225/
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-2.12.2025.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250212T140000
DTEND;TZID=America/New_York:20250212T150000
DTSTAMP:20260410T141214
CREATED:20250123T194306Z
LAST-MODIFIED:20250228T212617Z
UID:10003661-1739368800-1739372400@cmsa.fas.harvard.edu
SUMMARY:Discovering Data Structures: Nearest Neighbor Search and Beyond
DESCRIPTION:New Technologies in Mathematics Seminar \nSpeaker: Omar Salemohamed\, Mila \nTitle: Discovering Data Structures: Nearest Neighbor Search and Beyond \nAbstract: As neural networks learn increasingly sophisticated tasks—from image recognition to mastering the game of Go—we ask: can deep learning discover data structures entirely from scratch? We introduce a general framework for data structure discovery\, which adapts to the underlying data distribution and provides fine-grained control over query and space complexity. For nearest neighbor (NN) search\, our model (re)discovers classic algorithms like binary search in one dimension and learns structures reminiscent of k-d trees and locality-sensitive hashing in higher dimensions. Additionally\, the model learns useful representations of high-dimensional data such as images and exploits them to design effective data structures. Beyond NN search\, we believe the framework could be a powerful tool for data structure discovery for other problems and adapt our framework to the problem of estimating frequencies over a data stream. To encourage future work in this direction\, we conclude with a discussion on some of the opportunities and remaining challenges of learning data structures end-to-end.
URL:https://cmsa.fas.harvard.edu/event/newtech_21225/
LOCATION:Virtual
CATEGORIES:New Technologies in Mathematics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-NTM-Seminar-2.12.2025.docx-1.png
END:VEVENT
END:VCALENDAR