dorsal/arxiv
View SchemaA Finite-Sample Strong Converse for Binary Hypothesis Testing via (Reverse) R\'enyi Divergence
| Authors | Roberto Bruno, Adrien Vandenbroucque, Amedeo Roberto Esposito |
|---|---|
| Categories | |
| ArXiv ID | 2601.09550vv1 |
| URL | https://arxiv.org/abs/2601.09550 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
This work investigates binary hypothesis testing between $H_0\sim P_0$ and $H_1\sim P_1$ in the finite-sample regime under asymmetric error constraints. By employing the ``reverse" R\'enyi divergence, we derive novel non-asymptotic bounds on the Type II error probability which naturally establish a strong converse result. Furthermore, when the Type I error is constrained to decay exponentially with a rate $c$, we show that the Type II error converges to 1 exponentially fast if $c$ exceeds the Kullback-Leibler divergence $D(P_1\|P_0)$, and vanishes exponentially fast if $c$ is smaller. Finally, we present numerical examples demonstrating that the proposed converse bounds strictly improve upon existing finite-sample results in the literature.
{
"annotation_id": "6854c04d-6706-46ad-804b-6875ab7f3cc0",
"date_created": "2026-02-17T05:53:19.950000Z",
"date_modified": "2026-02-17T05:53:19.950000Z",
"file_hash": "2e27da27a9b6c509b0e9cf21cb8d969ab3bcc0ba04f790795a7aa1fa3e540f88",
"private": false,
"record": {
"abstract": "This work investigates binary hypothesis testing between $H_0\\sim P_0$ and $H_1\\sim P_1$ in the finite-sample regime under asymmetric error constraints. By employing the ``reverse\" R\\\u0027enyi divergence, we derive novel non-asymptotic bounds on the Type II error probability which naturally establish a strong converse result. Furthermore, when the Type I error is constrained to decay exponentially with a rate $c$, we show that the Type II error converges to 1 exponentially fast if $c$ exceeds the Kullback-Leibler divergence $D(P_1\\|P_0)$, and vanishes exponentially fast if $c$ is smaller. Finally, we present numerical examples demonstrating that the proposed converse bounds strictly improve upon existing finite-sample results in the literature.",
"arxiv_id": "2601.09550",
"authors": [
"Roberto Bruno",
"Adrien Vandenbroucque",
"Amedeo Roberto Esposito"
],
"categories": [
"cs.IT",
"math.IT"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "A Finite-Sample Strong Converse for Binary Hypothesis Testing via (Reverse) R\\\u0027enyi Divergence",
"url": "https://arxiv.org/abs/2601.09550",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e1e056f6-3517-487e-8970-fcf783b1485d",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}