Contraction of Locally Differentially Private Mechanisms

被引:3
作者
Asoodeh, Shahab [1 ,2 ]
Zhang, Huanyu [3 ]
机构
[1] Metas Stat & Privacy Team, New York, NY 10003 USA
[2] McMaster Univ, Dept Comp & Software, Hamilton, ON L8S IC7, Canada
[3] Meta Platforms Inc, New York, NY 10003 USA
来源
IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY | 2024年 / 5卷
关键词
Differential privacy; data processing inequality; contraction coefficient; minimax estimation risk; f-divergences; INFORMATION CONSTRAINTS; COEFFICIENTS; CONVERGENCE; DIVERGENCE; INFERENCE; ENTROPY;
D O I
10.1109/JSAIT.2024.3397305
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We investigate the contraction properties of locally differentially private mechanisms. More specifically, we derive tight upper bounds on the divergence between PK and QK output distributions of an epsilon-LDP mechanism K in terms of a divergence between the corresponding input distributions P and Q, respectively. Our first main technical result presents a sharp upper bound on the chi(2)-divergence chi(2)(PK||QK) in terms of chi(2)(P||Q) and epsilon. We also show that the same result holds for a large family of divergences, including KL-divergence and squared Hellinger distance. The second main technical result gives an upper bound on chi(2)(PK||QK) in terms of total variation distance TV(P, Q) and epsilon. We then utilize these bounds to establish locally private versions of the van Trees inequality, Le Cam's, Assouad's, and the mutual information methods-powerful tools for bounding minimax estimation risks. These results are shown to lead to tighter privacy analyses than the state-of-the-arts in several statistical problems such as entropy and discrete distribution estimation, non-parametric density estimation, and hypothesis testing.
引用
收藏
页码:385 / 395
页数:11
相关论文
共 50 条
[21]   Locally Differentially Private Reinforcement Learning for Linear Mixture Markov Decision Processes [J].
Liao, Chonghua ;
He, Jiafan ;
Gu, Quanquan .
ASIAN CONFERENCE ON MACHINE LEARNING, VOL 189, 2022, 189
[22]   Differentially Private Maximum Consensus [J].
Wang, Xin ;
He, Jianping ;
Cheng, Peng ;
Chen, Jiming .
IFAC PAPERSONLINE, 2017, 50 (01) :9509-9514
[23]   Classical Mechanism is Optimal in Classical-Quantum Differentially Private Mechanisms [J].
Yoshida, Yuuya ;
Hayashi, Masahito .
2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, :1973-1977
[24]   Locally Differentially Private Gradient Tracking for Distributed Online Learning Over Directed Graphs [J].
Chen, Ziqin ;
Wang, Yongqiang .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2025, 70 (05) :3040-3055
[25]   INTERACTIVE VERSUS NONINTERACTIVE LOCALLY DIFFERENTIALLY PRIVATE ESTIMATION: TWO ELBOWS FOR THE QUADRATIC FUNCTIONAL [J].
Butucea, Cristina ;
Rohde, Angelika ;
Steinberger, Lukas .
ANNALS OF STATISTICS, 2023, 51 (02) :464-486
[26]   DIFFERENTIALLY PRIVATE SAMPLING FROM DISTRIBUTIONS [J].
Raskhodnikova, Sofya ;
Sivakumar, Satchit ;
Smith, Adam ;
Swanberg, Marika .
SIAM JOURNAL ON COMPUTING, 2021, 54 (02) :419-468
[27]   Differentially Private Consensus With Quantized Communication [J].
Gao, Lan ;
Deng, Shaojiang ;
Ren, Wei ;
Hu, Chunqiang .
IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (08) :4075-4088
[28]   Differentially Private Assouad, Fano, and Le Cam [J].
Acharya, Jayadev ;
Sun, Ziteng ;
Zhang, Huanyu .
ALGORITHMIC LEARNING THEORY, VOL 132, 2021, 132
[29]   Differentially Private Decentralized Optimization With Relay Communication [J].
Wang, Luqing ;
Guo, Luyao ;
Yang, Shaofu ;
Shi, Xinli .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2025, 20 :724-736
[30]   Differentially Private ADMM Algorithms for Machine Learning [J].
Shang, Fanhua ;
Xu, Tao ;
Liu, Yuanyuan ;
Liu, Hongying ;
Shen, Longjie ;
Gong, Maoguo .
IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2021, 16 :4733-4745