BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://tilos.ai
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260506T110000
DTEND;TZID=America/Los_Angeles:20260506T120000
DTSTAMP:20260525T051127
CREATED:20251013T161935Z
LAST-MODIFIED:20260513T233600Z
UID:7644-1778065200-1778068800@tilos.ai
SUMMARY:TILOS-HDSI Seminar: Machine learning for discrete optimization: Theoretical foundations
DESCRIPTION:Ellen Vitercik\, Stanford University \nAbstract: Many of the most important optimization problems in practice are massive in scale\, mathematically complex\, and involve numerous unknown parameters. Machine learning offers a powerful way to address these challenges by uncovering hidden structure across problem instances\, but integrating predictions into algorithms raises fundamental questions: which architectures align with combinatorial structure\, and how can we ensure robustness to error? This talk presents two case studies. First\, we show how graph neural networks can approximate the optimal dynamic program for online matching\, yielding algorithms that generalize across graph sizes and achieve strong empirical performance. Second\, we investigate calibration as a principled interface between machine learning and decision-making\, demonstrating through rent-or-buy and job scheduling problems that calibrated predictions yield both theoretical guarantees and practical improvements. This is joint work with Alexandre Hayderi\, Amin Saberi\, Anders Wikum\, and Judy Hanwen Shen. \n\nEllen Vitercik is an Assistant Professor at Stanford University with a joint appointment between the Management Science & Engineering department and the Computer Science department. Her research interests include machine learning\, algorithm design\, discrete and combinatorial optimization\, and the interface between economics and computation. Before joining Stanford\, she spent a year as a Miller Postdoctoral Fellow at UC Berkeley and received a PhD in Computer Science from Carnegie Mellon University. Her research has been recognized with a Schmidt Sciences AI2050 Early Career Fellowship\, an NSF CAREER award\, the SIGecom Doctoral Dissertation Award\, and the CMU School of Computer Science Distinguished Dissertation Award\, among other honors.
URL:https://tilos.ai/event/tilos-hdsi-seminar-machine-learning-for-discrete-optimization-theoretical-foundations/
LOCATION:HDSI 123 and Virtual\, 3234 Matthews Ln\, La Jolla\, CA\, 92093\, United States
CATEGORIES:TILOS Seminar Series
ATTACH;FMTTYPE=image/jpeg:https://tilos.ai/wp-content/uploads/2025/10/vitericik-ellen-e1760372346890.jpg
END:VEVENT
END:VCALENDAR