Minimax and Adaptive Covariance Matrix Estimation under Differential Privacy
Estimating covariance matrices is fundamental to a wide range of statistical applications. This paper studies minimax and adaptive estimation of high-dimensional covariance matrices under $ρ$-zero-concentrated differential privacy ($ρ$-zCDP) over three nested classes: the pointwise-decay class $\mathcal{H}_α$, the row-tail class $\mathcal{G}_α$, and the separated-block class $\mathcal{F}_α$. We consider both squared operator norm loss and normalized squared Frobenius norm loss. For $\mathcal{H}_α$ and $\mathcal{G}_α$, we develop center--outer dyadic estimators tailored to the refined geometry of the two classes, while for $\mathcal{F}_α$, we develop a blockwise tridiagonal estimator. The resulting minimax-optimal rates reveal a nontrivial interplay among the smoothness $α$, the loss, the geometry of the covariance class, and the privacy constraint. In contrast to the non-private setting, privacy distinguishes covariance classes that share the same leading non-private rate and induces a polynomial dependence on the ambient dimension. We further develop procedures that adapt to the unknown decay parameter over all three covariance classes under both losses, at the cost of at most polylogarithmic factors. To establish minimax lower bounds, we develop a novel differentially private van Trees inequality that connects Fisher information with the $ρ$-zCDP constraint and may be useful for other private estimation problems. We also construct carefully designed prior distributions to obtain matching minimax lower bounds.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Minimax Estimation of Bandable Precision Matrices
The inverse covariance matrix provides considerable insight for understanding statistical models in the multivariate setting. In particular, when the distribution over variables is assumed to be multivariate normal, the …
Covariance Estimation for Matrix-valued Data
Covariance estimation for matrix-valued data has received an increasing interest in applications. Unlike previous works that rely heavily on matrix normal distribution assumption and the requirement of fixed matrix size,…
Optimal Differentially Private PCA and Estimation for Spiked Covariance Matrices
Estimating a covariance matrix and its associated principal components is a fundamental problem in contemporary statistics. While optimal estimation procedures have been developed with well-understood properties, the inc…
validQuantizing Heavy-tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recovery
This paper studies the quantization of heavy-tailed data in some fundamental statistical estimation problems, where the underlying distributions have bounded moments of some order. We propose to truncate and properly dit…
compressed sensingMatrix CompletionQuantizationMinimax sparse principal subspace estimation in high dimensions
We study sparse principal components analysis in high dimensions, where $p$ (the number of variables) can be much larger than $n$ (the number of observations), and analyze the problem of estimating the subspace spanned b…
Vocal Bursts Intensity Prediction