BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260521T091353
DTSTART;TZID=America/Detroit:20260603T100000
DTEND;TZID=America/Detroit:20260603T120000
SUMMARY:Presentation:Privacy for Structured Data Release: Time-Discounted Continual Release and Randomized Quantization
DESCRIPTION:Abstract:\n\nDifferential privacy provides a formal framework for limiting disclosure risk in computations on sensitive data. This dissertation studies differential privacy in structured data-release settings\, focusing on two forms of structure: temporal structure in continual release and quantization structure in finite-level release.\n\nFirst\, we propose time-discounted differential privacy (TDDP) for continual release. Standard continual-release privacy definitions do not distinguish events by temporal distance\, whereas the time-discounted formulation allows privacy requirements to decay as events become older. We develop mechanisms for this setting and analyze their privacy and utility guarantees.\n\nSecond\, we analyze the Random Quantization Mechanism (RQM) of Youn et al.\, a mechanism that provides privacy-preserving randomized quantization through subsampling. The mechanism itself is not a contribution of this thesis\; rather\, we derive\, under specified hyperparameter calibration requirements\, a formal privacy characterization of RQM\, including Rényi DP guarantees\, a max-divergence/pure-DP refinement\, and reconstruction-error bounds. These results make precise privacy claims that were not explicitly established in the original presentation of the mechanism. We then study RQM as a randomized quantization procedure\, focusing on how preprocessing choices affect its behavior on unbounded and heavy-tailed data.\n\nFinally\, we complement the theoretical analysis with an empirical study of RQM in several new settings\, beginning with private mean estimation and then considering distributional approximation\, clustering\, and image obfuscation. The results show that RQM is most natural when quantization is already compatible with the intended data representation\, while also highlighting its sensitivity to parameter choices and application context.
UID:148370-21904025@events.umich.edu
URL:https://events.umich.edu/event/148370
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Dissertation,Graduate,Graduate Students,Mathematics
LOCATION:East Hall - 4088
CONTACT:
END:VEVENT
END:VCALENDAR