Activity Number:
|
120
- Challenges and Recent Advances in Private Data Analysis
|
Type:
|
Topic-Contributed
|
Date/Time:
|
Monday, August 9, 2021 : 1:30 PM to 3:20 PM
|
Sponsor:
|
Section on Nonparametric Statistics
|
Abstract #317106
|
|
Title:
|
The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Bounds
|
Author(s):
|
Yichen Wang* and Tony Cai and Linjun Zhang
|
Companies:
|
University of Pennsylvania and University of Pennsylvania and Rutgers University
|
Keywords:
|
|
Abstract:
|
In this paper, we propose differentially private algorithms for parameter estimation in both low-dimensional and high-dimensional sparse generalized linear models (GLMs) by constructing private versions of projected gradient descent. We show that the proposed algorithms are nearly rate-optimal by characterizing their statistical performance and establishing privacy-constrained minimax lower bounds for GLMs. The lower bounds are obtained via a novel technique, which is based on Stein's Lemma and generalizes the tracing attack technique for privacy-constrained lower bounds. This lower bound argument can be of independent interest as it is applicable to general parametric models. Simulated and real data experiments are conducted to demonstrate the numerical performance of our algorithms.
|
Authors who are presenting talks have a * after their name.