BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Penn Engineering Events
X-ORIGINAL-URL:https://seasevents.nmsdev7.com
X-WR-CALDESC:Events for Penn Engineering Events
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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240410T120000
DTEND;TZID=America/New_York:20240410T133000
DTSTAMP:20260403T154501
CREATED:20240401T152812Z
LAST-MODIFIED:20240401T152812Z
UID:11173-1712750400-1712755800@seasevents.nmsdev7.com
SUMMARY:ASSET Seminar: "What Should We “Trust” in Trustworthy Machine Learning?" (Aaron Roth\, University of Pennsylvania)
DESCRIPTION:ABSTRACT: \n\n\n“Trustworthy Machine Learning” has become a buzz-word in recent years. But what exactly are the semantics of the promise that we are supposed to trust? In this talk we will make a proposal\, through the lens of downstream decision makers using machine learning predictions of payoff relevant states: Predictions are “Trustworthy” if it is in the interests of the downstream decision makers to act as if the predictions are correct\, as opposed to gaming the system in some way. We will find that this is a fruitful idea. For many kinds of downstream tasks\, predictions of the payoff relevant state that are statistically unbiased\, subject to a modest number of conditioning events\, suffice to give downstream decision makers strong guarantees when acting optimally as if the predictions were correct — and it is possible to efficiently produce predictions (even in adversarial environments!) that satisfy these bias properties. This methodology also gives an algorithm design principle that turns out to give new\, efficient algorithms for a variety of adversarial learning problems\, including obtaining subsequence regret in online combinatorial optimization problems and extensive form games\, and for obtaining sequential prediction sets for multiclass classification problems that have strong\, conditional coverage guarantees — directly from a black box prediction technology\, avoiding the need to choose a “score function” as in conformal prediction. \n  \nThis is joint work with Georgy Noarov\, Ramya Ramalingam\, and Stephan Xie \n\n\n\nZOOM LINK (if unable to attend in-person): https://upenn.zoom.us/j/96814843409
URL:https://seasevents.nmsdev7.com/event/asset-seminar-what-should-we-trust-in-trustworthy-machine-learning-aaron-roth-university-of-pennsylvania/
LOCATION:Raisler Lounge (Room 225)\, Towne Building\, 220 South 33rd Street\, Philadelphia\, PA\, 19104\, United States
END:VEVENT
END:VCALENDAR