Metraipolis › archive › dc_847dd185e7db
Finite-Sample Binary Hypothesis Testing via Rényi Divergences: Strong Converse and Local Privacy — arXiv:2609.27617
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.27617
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T12:11:58.746Z
- SHA-256 of the archived text
3dd76a024868fd56f4f052686db20de574a12e95581b8548ce780d6f50209b06- Stable URL of this page
https://metraipolis.com/documento/dc_847dd185e7db
How to cite
Finite-Sample Binary Hypothesis Testing via Rényi Divergences: Strong Converse and Local Privacy — arXiv:2609.27617 — arXiv (en), https://arxiv.org/abs/2609.27617 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_847dd185e7db (Metraipolis archive dc_847dd185e7db, sha256 3dd76a024868fd56f4f052686db20de574a12e95581b8548ce780d6f50209b06)
BibTeX
@misc{dc847dd185e7db,
title = {Finite-Sample Binary Hypothesis Testing via Rényi Divergences: Strong Converse and Local Privacy — arXiv:2609.27617},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.27617},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_847dd185e7db; sha256 3dd76a024868fd56f4f052686db20de574a12e95581b8548ce780d6f50209b06},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27617. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study asymmetric simple binary hypothesis testing between $H_0:P_0^{n}$ and $H_1:P_1^{n}$, based on $n$ independent and identically distributed observations. Leveraging a variational representation of Rényi divergence of order $\alpha$, we derive our main result: a finite-sample converse with $\alpha>1$. The bound uses both directions of the divergence $D_\alpha(P_1\|P_0)$ and $D_\alpha(P_0\|P_1)$, tensorises under product measures, and contains familiar data-processing converses as boundary cases. For comparison, we apply the same variational approach to general $f$-divergences and specialise it to total variation, $E_\gamma$, Hellinger, and Kullback Leibler divergences, thereby recovering familiar converses within a unified framework. Together with an achievability bound involving Rényi divergence with $\alpha\in (0,1)$, the main converse recovers the phase transition of the optimal Type II error under the exponentially decaying Type I error constraint $\varepsilon_n=e^{-nr}$. Under regularity conditions, the optimal Type II error vanishes exponentially when $r<D(P_1\|P_0)$ and converges exponentially fast to one when $r>D(P_1\|P_0)$. We also derive sample-complexity bounds and extend both the converse and achievability analyses to locally differentially private observations, quantifying the cost of privacy and recovering the non-private achievability bound as the privacy constraint vanishes.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-24 in math.IT).
Categorie arXiv: Information Theory (cs.IT) ; Statistics Theory (math.ST).
Pagina del lavoro: https://arxiv.org/abs/2609.27617 — 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-08T12:10:03.924Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).