Metraipolis › archive › dc_462d6ca443cd

Scale Analysis and Shape Selection for the Generalized Gaussian Mechanism under Approximate Differential Privacy — arXiv:2608.31138

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.31138
License (as archived)
CC0-1.0
Archived
2026-10-17T09:00:11.014Z
SHA-256 of the archived text
7d424ab44b30cb2a91fbd9822890276d7866aac9ada7ab287861146a2f722cd3
Stable URL of this page
https://metraipolis.com/documento/dc_462d6ca443cd

How to cite

Scale Analysis and Shape Selection for the Generalized Gaussian Mechanism under Approximate Differential Privacy — arXiv:2608.31138 — arXiv (en), https://arxiv.org/abs/2608.31138 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_462d6ca443cd (Metraipolis archive dc_462d6ca443cd, sha256 7d424ab44b30cb2a91fbd9822890276d7866aac9ada7ab287861146a2f722cd3)
BibTeX
@misc{dc462d6ca443cd,
  title = {Scale Analysis and Shape Selection for the Generalized Gaussian Mechanism under Approximate Differential Privacy — arXiv:2608.31138},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.31138},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_462d6ca443cd; sha256 7d424ab44b30cb2a91fbd9822890276d7866aac9ada7ab287861146a2f722cd3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.31138. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 special cases $p=1$ and $p=2$, respectively. This paper studies the privacy-feasible scale estimation and the shape parameter selection of the generalized Gaussian mechanism (GGM) under $(\varepsilon,\delta)$-differential privacy. For a given sensitivity vector $\Delta$ and $p\in[1,\infty]$, let $b(p)$ denote the smallest value of the scale parameter for which the mechanism satisfies this privacy requirement. In the one-dimensional case, $b(p)$ can be implicitly characterized by a system of equations. For vector-valued queries, we construct a computable upper approximation of $b(p)$ that preserves the privacy guarantee. Shapes are compared under a scale-homogeneous utility criterion, with the $m$-th absolute moment as the main example. We develop an interval-wise shape search algorithm with an approximation guarantee that can be made arbitrarily precise. We also establish the invariance of the optimal shape under rescaling of the sensitivity vector and characterize its limiting behaviour under high privacy limits. Computational experiments show that optimizing shape parameters can improve utility by reducing the variance of each coordinate by 5% to 20% across a variety of cases, with some cases showing even greater reductions, while maintaining the same level of privacy protection. Task-specific experiments further show that shape optimization can improve task-level utility, reduce attacker success, or achieve both.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-01 in stat.ME).
Categorie arXiv: Statistics Theory (math.ST) ; Methodology (stat.ME).
Pagina del lavoro: https://arxiv.org/abs/2608.31138 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T08:39:34.538Z dalla pagina https://arxiv.org/catchup/stat.ME/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).