BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.16.3//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: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:20251016T120000
DTEND;TZID=America/New_York:20251016T130000
DTSTAMP:20260601T225114
CREATED:20250828T185054Z
LAST-MODIFIED:20250828T185054Z
UID:20941-1760616000-1760619600@seasevents.nmsdev7.com
SUMMARY:FOLDS seminar:  A New Paradigm for Learning with Distribution Shift
DESCRIPTION:Zoom link: https://upenn.zoom.us/j/98220304722 \n  \nWe revisit the fundamental problem of learning with distribution shift\, where a learner is given labeled samples from training distribution D\, unlabeled samples from test distribution D′ and is asked to output a classifier with low test error. The standard approach in this setting is to prove a generalization bound in terms of some notion of distance between D and D′. These distances\, however\, are difficult to compute\, and this has been the main stumbling block for efficient algorithm design over the last two decades. \nWe sidestep this issue and define a new model called TDS learning\, where a learner runs a test on the training set and is allowed to reject if this test detects distribution shift relative to a fixed output classifier.  This approach leads to the first set of efficient algorithms for learning with distribution shift that do not take any assumptions on the test distribution.  Finally\, we discuss how our techniques have recently been used to solve longstanding problems in supervised learning with contamination.
URL:https://seasevents.nmsdev7.com/event/folds-seminar-tba-4/
LOCATION:Eyebrow
CATEGORIES:Seminar,Colloquium
END:VEVENT
END:VCALENDAR