2018/10/16 by Min Ye, Alexander Barg, Ye, Min +1 · 1 citation
Computer Science · Engineering · #Cryptography and Data Security #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Machine Learning (cs.LG) #Privacy-Preserving Technologies in Data #Statistics Theory (math.ST) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1810.07283
openalex publication_date 2018/10/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider the minimax estimation problem of a discrete distribution with support size k under locally differential privacy constraints. A privatization scheme is applied to each raw sample independently, and we need to estimate the distribution of the raw samples from the privatized samples. A positive number ε measures the privacy level of a privatization scheme. In our previous work (IEEE Trans. Inform. Theory, 2018), we proposed a family of new privatization schemes and the corresponding estimator. We also proved that our scheme and estimator are order optimal in the regime eε ≪ k under both ℓ22 (mean square) and ℓ1 loss. In this paper, we sharpen this result by showing asymptotic optimality of the proposed scheme under the ℓpp loss for all 1≤ p≤ 2. More precisely, we show that for any p∈[1,2] and any k and ε, the ratio between the worst-case ℓpp estimation loss of our scheme and the optimal value approaches 1 as the number of samples tends to infinity. The lower bound on the minimax risk of private estimation that we establish as a part of the proof is valid for any loss function ℓpp, p≥ 1.