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:20250220T120000
DTEND;TZID=America/New_York:20250220T131500
DTSTAMP:20260602T152207
CREATED:20250131T195445Z
LAST-MODIFIED:20250131T195445Z
UID:13102-1740052800-1740057300@seasevents.nmsdev7.com
SUMMARY:IDEAS/STAT Optimization Seminar: "Theoretical foundations for multi-agent learning"
DESCRIPTION:As learning algorithms become increasingly capable of acting autonomously\, it is important to better understand the behavior that results from their interactions. For example\, a pervasive challenge in multi-agent learning settings\, which spans both theory and practice and dates back decades\, has been the failure of convergence for iterative algorithms such as gradient descent. Accordingly\, a longstanding central question with broad relevance is: how quickly can we compute solution concepts\, i.e.\, equilibria\, in multi-agent settings?\n\nI will discuss results which address this question at a variety of levels\, starting from foundational settings involving normal-form games and building up to complex problems such as multi-agent reinforcement learning which more aptly model realistic situations. First\, I will present a result establishing a near-optimal convergence rate for a simple online learning algorithm in normal-form games\, resolving a decade-long line of work which gave suboptimal bounds. I will then discuss a new algorithm for minimizing swap regret exponentially faster than previous approaches. Our algorithm allows us to answer several open questions\, such as by establishing the first PTAS for correlated equilibria in extensive-form games.\n\nBeyond contending with agents’ differing incentives\, the increasing use of machine learning algorithms presents other challenges\, such as the proliferation of AI-generated content. In the latter part of the talk\, I will discuss an approach to detect such content via watermarking. Our watermarking scheme is the first to embed a watermark in a language model’s output in a way which only leads to negligible changes in the distribution of the output but which is robust to adversarial edits.\n\nZoom link: https://upenn.zoom.us/j/98090439937 (Meeting ID: 980 9043 9937)
URL:https://seasevents.nmsdev7.com/event/ideas-stat-optimization-seminar-noah-golowich/
LOCATION:Amy Gutmann Hall\, Room 414\, 3333 Chestnut Street\, Philadelphia\, 19104\, United States
CATEGORIES:Seminar,Colloquium
END:VEVENT
END:VCALENDAR