BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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:20231122T100000
DTEND;TZID=America/New_York:20231122T120000
DTSTAMP:20260404T001216
CREATED:20231117T211318Z
LAST-MODIFIED:20231117T211318Z
UID:10007763-1700647200-1700654400@seasevents.nmsdev7.com
SUMMARY:ESE PhD Thesis Defense: "Learning\, Privacy\, and Reliable Communication in Large Data Networks"
DESCRIPTION:This thesis explores advancements in three distinct domains: communications\, privacy\, and machine learning. Within the realm of communication\, a comprehensive study is conducted on channel coding at low capacity\, a critical aspect of Internet of Things (IoT) technology requiring reliable transmission over channels with minimal capacity. Despite existing finite-length analyses yielding inaccurate predictions and current coding schemes proving inefficient in low-capacity scenarios\, this thesis addresses these limitations. It characterizes the finite-length fundamental limits of channel coding for essential channels\, offering provably efficient code designs tailored for low-capacity environments. In the domain of privacy\, attention is directed towards a decentralized consensus problem handled in a private manner. Existing methods for classical consensus problems often involve openly exchanging private information. This thesis proposes an algorithmic framework capable of achieving the exact limit and the fastest possible convergence rate while safeguarding the privacy of users’ local values. Additionally\, a novel information-theoretic metric is introduced to effectively measure the privacy of a node concerning another node within the network. In the machine learning domain\, a rigorous mathematical framework is established to investigate the function class of Graph Neural Networks (GNNs) in relation to their initialization and internal estimators. Utilizing a unique technique for the algebraic representation of a multiset of vectors\, termed Multiset Equivalent Function (MEF)\, it is demonstrated that GNNs can generate functions satisfying a weight-equipped variant of permutation-equivariance using distinct features. The MEF technique further reveals that GNNs\, equipped with node identifiers in their initialization\, can generate any function in a fully connected and weighted graph scenario. These findings contribute to a formal understanding of the intricate relationship between GNNs and other algorithmic procedures applied to graphs\, such as min-cut value and shortest path problems\, as well as the re-derivation of the known connection between GNNs and the Weisfeiler-Lehman graph-isomorphism test.
URL:https://seasevents.nmsdev7.com/event/ese-phd-thesis-defense-learning-privacy-and-reliable-communication-in-large-data-networks/
LOCATION:Raisler Lounge (Room 225)\, Towne Building\, 220 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