Metraipolis › archive › dc_9935ebcf1da5
Minimax signal detection in regression under differential privacy — arXiv:2611.04064
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04064
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:44:57.249Z
- SHA-256 of the archived text
a6f8880b5a32b4268aaf8f4bebbf455898f20b4f7ca530ff8fb0df0a0148df36- Stable URL of this page
https://metraipolis.com/documento/dc_9935ebcf1da5
How to cite
Minimax signal detection in regression under differential privacy — arXiv:2611.04064 — arXiv (en), https://arxiv.org/abs/2611.04064 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9935ebcf1da5 (Metraipolis archive dc_9935ebcf1da5, sha256 a6f8880b5a32b4268aaf8f4bebbf455898f20b4f7ca530ff8fb0df0a0148df36)
BibTeX
@misc{dc9935ebcf1da5,
title = {Minimax signal detection in regression under differential privacy — arXiv:2611.04064},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04064},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9935ebcf1da5; sha256 a6f8880b5a32b4268aaf8f4bebbf455898f20b4f7ca530ff8fb0df0a0148df36},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04064. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We establish minimax separation rates across sparsity levels for regression signal detection under $(\epsilon, \delta)$-central differential privacy, considering linear regression with an unknown error distribution and generalised linear models (GLMs) with an unknown intercept. Without sparsity restrictions, the separation rates for linear regression and GLMs with binary responses match the private Gaussian mean testing rate up to polylogarithmic factors. For GLMs with more than two possible response outcomes, additional information in the marginal response distribution permits faster detection of sufficiently small signals when the dimension exceeds the sample size $n$. Our upper bounds are based on a reduction to private mean testing, tests of dependence between the response and sparse covariate projections, and a response-only test that is adjusted for the unknown intercept. The resulting procedure adapts to unknown sparsity and matches our lower bounds up to polylogarithmic factors. We also construct polynomial-time tests that attain these rates when $\epsilon\gtrsim n^{-1/2}$, and compare their numerical performance with existing private procedures.
Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ME, nuovi lavori del giorno).
Categorie arXiv: Statistics Theory (math.ST) ; Methodology (stat.ME).
Pagina del lavoro: https://arxiv.org/abs/2611.04064 — 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-11-04T12:30:47.144Z dalla pagina https://arxiv.org/list/stat.ME/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).