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:20250417T120000
DTEND;TZID=America/New_York:20250417T131500
DTSTAMP:20260602T090609
CREATED:20250131T222300Z
LAST-MODIFIED:20250131T222300Z
UID:13140-1744891200-1744895700@seasevents.nmsdev7.com
SUMMARY:IDEAS/STAT Optimization Seminar: Resilient Distributed Optimization for Cyberphysical Systems
DESCRIPTION:Zoom link: https://upenn.zoom.us/j/98220304722 \n  \nAbstract:\nThis talk considers the problem of resilient distributed multi-agent optimization for cyberphysical systems in the presence of malicious or non-cooperative agents. It is assumed that stochastic values of trust between agents are available which allows agents to learn their trustworthy neighbors simultaneously with performing updates to minimize their own local objective functions. The development of this trustworthy computational model combines the tools from statistical learning and distributed consensus-based optimization. Specifically\, we derive a unified mathematical framework to characterize convergence\, deviation of the consensus from the true consensus value\, and expected convergence rate\, when there exists additional information of trust between agents. Under certain conditions\, we show  that the consensus protocol has almost sure convergence to a common limit value is possible even when malicious agents constitute more than half of the network;  the deviation of the converged limit\, from the nominal no attack case can be bounded with probability that approaches 1 exponentially\, and that correct classification of malicious and legitimate agents can be attained in (random) finite time almost surely. Further\, the expected convergence rate decays exponentially with the quality of the trust observations between agents. We then combine the trust-learning model within a distributed gradient-based method for solving a multi-agent optimization problem and characterize its performance.
URL:https://seasevents.nmsdev7.com/event/ideas-stat-optimization-seminar-angelia-nedich/
LOCATION:Amy Gutmann Hall\, Room 414\, 3333 Chestnut Street\, Philadelphia\, 19104\, United States
CATEGORIES:Seminar,Colloquium
END:VEVENT
END:VCALENDAR