Metraipolis › archive › dc_5ede339cef8b

Local Sensitivity in Exponential Selection: Failure Modes and Valid Calibrations — arXiv:2610.11870

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11870
License (as archived)
CC0-1.0
Archived
2026-10-09T06:20:39.460Z
SHA-256 of the archived text
1594e13599a3cd721e8dbddee78df0f2b50d4c2c239a1cd2b36808e493a94ec1
Stable URL of this page
https://metraipolis.com/documento/dc_5ede339cef8b

How to cite

Local Sensitivity in Exponential Selection: Failure Modes and Valid Calibrations — arXiv:2610.11870 — arXiv (en), https://arxiv.org/abs/2610.11870 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5ede339cef8b (Metraipolis archive dc_5ede339cef8b, sha256 1594e13599a3cd721e8dbddee78df0f2b50d4c2c239a1cd2b36808e493a94ec1)
BibTeX
@misc{dc5ede339cef8b,
  title = {Local Sensitivity in Exponential Selection: Failure Modes and Valid Calibrations — arXiv:2610.11870},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11870},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5ede339cef8b; sha256 1594e13599a3cd721e8dbddee78df0f2b50d4c2c239a1cd2b36808e493a94ec1},
  year = {2026}
}

Archived text

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

Selection is a task that chooses one element from a finite public candidate range to maximize a data-dependent score. In differential privacy (DP), the exponential mechanism (EM) samples a candidate at a temperature calibrated to the global sensitivity. In this paper, we study when dataset-dependent sensitivity can safely replace global sensitivity in private selection. We propose three valid approaches. First, a private, high-probability upper bound on local sensitivity yields approximate DP, and the method extends to finite higher-order sensitivity hierarchies. Second, our Propose-Test-Release (PTR) variant privately searches a finite public grid for a temperature scale rather than fixing it in advance. Third, smooth sensitivity supports several designs. A candidate-independent smooth geometric construction produces a sensitivity envelope that is admissible under the local dampening framework, which privacy is guaranteed for any admissible envelope. Additionally, a separate logarithmic transformation utilizes smooth sensitivity to produce a smoothed candidate score function with advantages: having controlled global sensitivity, and preserving the maximizers of the original utility score, i.e., candidates maximizing the utility. Both of the designs yield range-independent pure DP. Besides that, we also give two approximate DP private selectors using smooth sensitivity: a direct EM with smooth sensitivity calibrated to the candidate range and privacy parameters that matches a theoretical lower bound up to some constant factor, and one using a privatized smooth upper scale by analyzing the logarithmic transform of the smoothness. For every proposed mechanism, we derive a high-probability regret bound under its stated conditions.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2610.11870 — 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-09T05:50:01.001Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).