THE RIGHT COMPLEXITY MEASURE IN LOCALLY PRIVATE ESTIMATION: IT IS NOT THE FISHER INFORMATION

被引:1
作者
Duchi, John C. [1 ]
Ruan, Feng [2 ]
机构
[1] Stanford Univ, Dept Stat, Stanford, CA 94305 USA
[2] Northwestern Univ, Dept Stat & Data Sci, Evanston, IL USA
关键词
Locally private estimation; local minimax complexity; L-1; information; strong data processing inequalities; GEOMETRIZING RATES; RANDOMIZED-RESPONSE; APPROXIMATION;
D O I
10.1214/22-AOS2227
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We identify fundamental tradeoffs between statistical utility and privacy under local models of privacy in which data is kept private even from the statistician, providing instance-specific bounds for private estimation and learning problems by developing the local minimax risk. In contrast to approaches based on worst-case (minimax) error, which are conservative, this allows us to evaluate the difficulty of individual problem instances and delineate the possibilities for adaptation in private estimation and inference. Our main results show that the local modulus of continuity of the estimand with respect to the variation distance-as opposed to the Hellinger distance central to classical statistics-characterizes rates of convergence under locally private estimation for many notions of privacy, including differential privacy and its relaxations. As consequences of these results, we identify an alternative to the Fisher information for private estimation, giving a more nuanced understanding of the challenges of adaptivity and optimality.
引用
收藏
页码:1 / 51
页数:51
相关论文
共 57 条
[1]   Deep Learning with Differential Privacy [J].
Abadi, Martin ;
Chu, Andy ;
Goodfellow, Ian ;
McMahan, H. Brendan ;
Mironov, Ilya ;
Talwar, Kunal ;
Zhang, Li .
CCS'16: PROCEEDINGS OF THE 2016 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2016, :308-318
[2]   Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization [J].
Agarwal, Alekh ;
Bartlett, Peter L. ;
Ravikumar, Pradeep ;
Wainwright, Martin J. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (05) :3235-3249
[3]  
Apple, 2017, Learning with privacy at scale
[4]   The Privacy Blanket of the Shuffle Model [J].
Balle, Borja ;
Bell, James ;
Gascon, Adria ;
Nissim, Kobbi .
ADVANCES IN CRYPTOLOGY - CRYPTO 2019, PT II, 2019, 11693 :638-667
[5]  
Bickel PJ., 1998, EFFICIENT ADAPTIVE E
[6]   APPROXIMATION IN METRIC-SPACES AND ESTIMATION THEORY [J].
BIRGE, L .
ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1983, 65 (02) :181-237
[7]  
Brown LD, 1996, ANN STAT, V24, P2524
[8]  
Brown LD, 1986, Fundamentals of Statistical Exponential Families: With Applications in Statistical Decision Theory
[9]   Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds [J].
Bun, Mark ;
Steinke, Thomas .
THEORY OF CRYPTOGRAPHY, TCC 2016-B, PT I, 2016, 9985 :635-658
[10]  
Duchi JC, 2020, Arxiv, DOI arXiv:1804.08116