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: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:20240709T150000
DTEND;TZID=America/New_York:20240709T180000
DTSTAMP:20260603T120755
CREATED:20240702T124633Z
LAST-MODIFIED:20240702T124633Z
UID:11665-1720537200-1720548000@seasevents.nmsdev7.com
SUMMARY:ESE Ph.D. Thesis Defense: "Graph Machine Learning under Requirements"
DESCRIPTION:Graphs are powerful mathematical tools that enable modeling of complex systems. Graph machine learning exploits possibly unknown data structures\, which provides a unified approach to tackle a wide variety of problems. However useful in practice\, graph machine learning solutions tend to suffer from three main limitations: they do not scale with the size of the graph\, they are not robust to changes of the graph\, and they require an homogeneous underlying graph. In this thesis we address all three of these requirements. In terms of scalability\, we show that Graph Neural Networks (GNNs) improve their generalization capabilities with the number of nodes. This positive result with ample empirical evidence\, motivates the need for scalable training solutions. To this end\, I developed two strategies to train GNNs on large scale graphs\, first by growing the graphs in time as we train\, and second by distributing the graph in a set of machines and growing the graph in space. These two methods alleviate the computational costs required to train GNNs on large scale graphs\, without compromising the accuracy. In terms of robustness\, even though many data modalities reside in a very high-dimensional space\, their dynamics can be assumed to belong to a lower-dimensional structure. We can model the low dimensional space using a graph Laplacian\, and show that the problem of learning a Lipschitz continuous function on a manifold is equivalent to a dynamically weighted manifold regularization problem. Heterogeneity is a fundamental property of networks. Even if a network is composed of homogeneous agents\, every agent will have different interactions with the environment\, which will translate into heterogeneous data acquisition. Graph machine learning solutions that do not address the heterogeneous nature of the data tend to only allocate the needs of some of the nodes in the graph. I propose two ways to tackle heterogeneity\, a single solution to improve the outcome of all the individual components in the network\, and a node-specific solution such that every agent in the network improves upon working with their individual data.
URL:https://seasevents.nmsdev7.com/event/ese-ph-d-thesis-defense-graph-machine-learning-under-requirements/
LOCATION:Greenberg Lounge (Room 114)\, Skirkanich Hall\, 210 South 33rd 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