Generalized Linear Models in Non-interactive Local Differential Privacy with Public Data

被引:0
作者
Wang, Di [1 ]
Hu, Lijie [1 ]
Zhang, Huanyu [2 ]
Gaboardi, Marco [3 ]
Xu, Jinhui [4 ]
机构
[1] King Abdullah Univ Sci & Technol, CEMSE, Thuwal, Saudi Arabia
[2] Meta, New York, NY USA
[3] Boston Univ, Dept Comp Sci, Boston, MA 02215 USA
[4] SUNY Buffalo, Dept Comp Sci & Engn, Buffalo, NY 14260 USA
基金
美国国家科学基金会;
关键词
Differential Privacy; Generalized Linear Models; Local Differential Privacy;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we study the problem of estimating smooth Generalized Linear Models (GLMs) in the Non-interactive Local Differential Privacy (NLDP) model. Unlike its classical setting, our model allows the server to access additional public but unlabeled data. In the first part of the paper, we focus on GLMs. Specifically, we first consider the case where each data record is i.i.d. sampled from a zero-mean multivariate Gaussian distribution. Motivated by the Stein's lemma, we present an (epsilon, delta)-NLDP algorithm for GLMs. Moreover, the sample complexity of public and private data for the algorithm to achieve an l(2)-norm estimation error of alpha (with high probability) is O(p alpha(-2)) and (O) over tilde (p(3)alpha(-2) epsilon(-2)) respectively, where p is the dimension of the feature vector. This is a significant improvement over the previously known exponential or quasi-polynomial in alpha-1, or exponential in p sample complexities of GLMs with no public data. Then we consider a more general setting where each data record is i.i.d. sampled from some sub-Gaussian distribution with bounded l(1)-norm. Based on a variant of Stein's lemma, we propose an (epsilon, delta)-NLDP algorithm for GLMs whose sample complexity of public and private data to achieve an l(infinity)-norm estimation error of alpha is O(p(2)alpha(-2)) and (O) over tilde (p(2)alpha(-2) epsilon(-2)) respectively, under some mild assumptions and if alpha is not too small (i.e., alpha >= Omega( 1/root p )). In the second part of the paper, we extend our idea to the problem of estimating non-linear regressions and show similar results as in GLMs for both multivariate Gaussian and sub-Gaussian cases. Finally, we demonstrate the effectiveness of our algorithms through experiments on both synthetic and real-world datasets. To our best knowledge, this is the first paper showing the existence of efficient and effective algorithms for GLMs and non-linear regressions in the NLDP model with unlabeled public data.
引用
收藏
页数:57
相关论文
共 59 条
  • [1] Arora R, 2024, Arxiv, DOI arXiv:2205.03014
  • [2] Arora R, 2023, Arxiv, DOI arXiv:2206.00846
  • [3] Searching for exotic particles in high-energy physics with deep learning
    Baldi, P.
    Sadowski, P.
    Whiteson, D.
    [J]. NATURE COMMUNICATIONS, 2014, 5
  • [4] Bassily R, 2021, ADV NEUR IN, V34
  • [5] Bassily R, 2018, Arxiv, DOI arXiv:1810.02810
  • [6] Bassily R, 2018, ADV NEUR IN, V31
  • [7] Private Empirical Risk Minimization: Efficient Algorithms and Tight Error Bounds
    Bassily, Raef
    Smith, Adam
    Thakurta, Abhradeep
    [J]. 2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 464 - 473
  • [8] Bassily Raef., 2019, arXiv
  • [9] Bhowmick A, 2019, Arxiv, DOI arXiv:1812.00984
  • [10] Blasiok J, 2019, Disc Algorithms, P2480