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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230714T110000
DTEND;TZID=America/New_York:20230714T130000
DTSTAMP:20260404T064428
CREATED:20230627T161203Z
LAST-MODIFIED:20230627T161203Z
UID:9302-1689332400-1689339600@seasevents.nmsdev7.com
SUMMARY:ESE PhD Thesis Defense: "Discrete and Continuous Optimization for Collaborative and Multi-task Learning"
DESCRIPTION:This thesis is dedicated to addressing the challenges of robust collaborative learning and optimization in both discrete and continuous domains. With the ever-increasing scale of data and the growing demand for effective distributed learning\, a multitude of obstacles emerge\, including communication limitations\, resilience to failures and corrupted data\, limited information access\, and collaboration in multi-task learning scenarios. The thesis consists of seven chapters\, each targeting specific aspects of these challenges. \nIn the first chapter\, novel algorithms are introduced for collaborative linear bandits\, offering a comprehensive exploration of the benefits of collaboration in the presence of adversaries through thorough analyses and lower bounds. The second chapter delves into multi-agent min-max learning problems by tackling the presence of Byzantine adversarial agents. Chapter three delves into the effects of delays within stochastic approximation schemes\, investigating non-asymptotic convergence rates under Markovian noise. \nMoving forward\, the fourth chapter focuses on analyzing the performance of standard min-max optimization algorithms with delayed updates. The fifth chapter concentrates on robustness in discrete learning\, specifically addressing convex-submodular problems in mixed continuous-discrete domains. The sixth chapter tackles the challenge of limited information access in collaborative problems with distributed constraints\, developing optimal algorithms for submodular maximization under distributed partition matroid constraints. \nLastly\, the seventh chapter introduces a discrete variant of multi-task learning and meta-learning. In summary\, this thesis contributes to the field of robust collaborative learning and decision-making by providing insights\, algorithms\, and theoretical guarantees in discrete and continuous optimization. The advancements made across linear bandits\, minimax optimization\, distributed robust learning\, delayed optimization\, and submodular maximization pave the way for future developments in collaborative and multi-task learning.
URL:https://seasevents.nmsdev7.com/event/ese-phd-thesis-defense-discrete-and-continuous-optimization-for-collaborative-and-multi-task-learning/
LOCATION:Room 452 C\, 3401 Walnut\, 3401 Walnut Street\, Philadelphia\, PA\, 19104\, United States
CATEGORIES:Dissertation or Thesis Defense
ORGANIZER;CN="Electrical and Systems Engineering":MAILTO:eseevents@seas.upenn.edu
END:VEVENT
END:VCALENDAR