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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211019T110000
DTEND;TZID=America/New_York:20211019T120000
DTSTAMP:20260406T125003
CREATED:20211013T193332Z
LAST-MODIFIED:20211013T193332Z
UID:5588-1634641200-1634644800@seasevents.nmsdev7.com
SUMMARY:ESE Fall Colloquium Seminar - "Distributed Estimation Under Privacy and Communication Constraints"
DESCRIPTION:Distributed estimation is a central task in modern data science\, where datasets are often generated from distributed sources or are too large to be stored on a centralized machine\, and communication is subject to bandwidth and privacy limitations. In this talk\, we will consider the problem of estimating high-dimensional distributions and their parameters from distributed samples under communication and differential privacy constraints. We will develop novel encoding and estimation mechanisms that simultaneously achieve optimal privacy and communication efficiency in various canonical settings\, including both probabilistic and so called “distribution-free” models. We will investigate both global (worst-case) as well as local complexity of these tasks\, where the latter captures the hardness of estimating a specific instance of the problem. We will complement our achievability results with information-theoretic lower bounds that describe how Fisher information from statistical samples scales with privacy and communication constraints. We will conclude by discussing how our theoretical results can be used to improve the experimental performance of federated learning algorithms.
URL:https://seasevents.nmsdev7.com/event/ese-fall-colloquium-seminar-distributed-estimation-under-privacy-and-communication-constraints/
LOCATION:Zoom – Meeting ID: 282 221 4402
ORGANIZER;CN="Electrical and Systems Engineering":MAILTO:eseevents@seas.upenn.edu
END:VEVENT
END:VCALENDAR