Skip to content
Preprint

On the privacy cost for dependent Gaussian data: spectral density estimation under local differential privacy

Aug 2026 · 0 citations
Mathematics

TL;DR

A minimax lower bound is established showing that, over Sobolev-type classes of spectral densities, the effective sample size in the high-privacy regime is $N\alpha^4$ rather than the usual $N\alpha^2$ arising for independent observations, and classical asymptotic equivalence with an independent Gaussian experiment generally fails under LDP.

Abstract

We study the fundamental problem of estimating the dependence structure of a centered stationary Gaussian process under local differential privacy (LDP). In this setting, the spectral density characterizes the dependence structure of the data and is the quantity to be estimated. Our main contribution is to close the open $\alpha^2$-versus-$\alpha^4$ gap between the previously known lower and upper bounds on the minimax rate. Specifically, we establish a minimax lower bound showing that, over Sobolev-type classes of spectral densities, the effective sample size in the high-privacy regime is $N\alpha^4$, rather than the usual $N\alpha^2$ arising for independent observations. This additional privacy cost is caused by the temporal dependence between the observations rather than by their marginal distributions. The proof relies on a contraction bound for privatized dependent Gaussian observations. Our second contribution is a matching upper bound, free of the polylogarithmic losses present in previous work. Rather than applying a generic privatization scheme to classical estimators, we construct a problem-specific procedure attaining the rate identified by our lower bound. Beyond closing the gaps in spectral density estimation, we apply the tools developed for this problem to several related questions. We (i) close the logarithmic gap for fixed-lag autocovariance estimation, (ii) show that the $\alpha^4$ cost arises locally around every spectral density bounded away from zero, and (iii) establish that classical asymptotic equivalence with an independent Gaussian experiment generally fails under LDP.

View source

Similar papers

Preprint Sep 2026

Faster Learning under Relaxed Local Differential Privacy

We consider density estimation under the relaxed local differential privacy condition that the privatized distributions are $\alpha$-close in total variation distance. We show that adding independent noise with a convenient symmetrized Gamma distribution to each sensitive observation attains the $\alpha$-TV-LDP. We pro...

Cristina Butucea, Hui-Yun Tang, M. Taupin · 0 citations
Preprint Aug 2026

Statistical Properties of Nonparametric MLE under Laplace Noise

This work studies the problem of estimating the distribution of the latent confidential data from the privatized observations via the nonparametric maximum likelihood estimator (NPMLE) under an i.i.d. sampling model, and shows that the NPMLE remains consistent when the Laplace noise grows at a rate slower than $n^{3/16...

Yifei Xiong, Nianqiao Ju, Vinayak A. Rao · 0 citations
Preprint Aug 2026

Scale Analysis and Shape Selection for the Generalized Gaussian Mechanism under Approximate Differential Privacy

Differential privacy provides a rigorous framework for protecting private information, typically achieved by adding random noise to query results. The generalized Gaussian family is a flexible class of additive noise distributions indexed by the shape parameter $p$ and includes the Laplace and Gaussian distributions as...

Xiang Zhang, M. O. Haye, Yi-Qiang Q. Zhao · 0 citations
Preprint Sep 2026

Exact Asymptotic Efficiency under zCDP: Diameter-Constrained Information Geometry

Protecting individual privacy has become a central and urgent concern in modern data analysis, given the vast quantities of data now generated and processed. In this paper, we develop a systematic theory of exact asymptotic efficiency for regular parametric estimation under central zero-concentrated differential privac...

T. Cai, Yi-Cheng Li · 0 citations
Review Oct 2026

Learning Sparse Support under Differential Privacy: Adaptive Algorithms and Minimax Limits

Saturated Propose-test-release, a general mechanism that privately releases the output of a discrete selector with probability one once its stability certificate reaches a finite threshold, is introduced and a computable support-stability score is constructed.

Jian-Zhong Gu, T. Cai · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.