Searcharxiv⌕ Search

arXiv subjects

Barış Nakiboğlu

Publications and source records attributed to Barış Nakiboğlu.

3 recordsLinked to original sources

A Spectral Representation Of The Simple Hypothesis Testing Problem

The minimum Type II error probability (or volume) of simple hypothesis tests with randomized detectors is expressed as a Riemann integral of the (cumulative) distribution function of the likelihood ratio for all non-negative Type I error probability (or volume) values: $β(\varepsilon)=\int_{0}^{\infty}|F(1/τ)-\varepsilon|^{+}dτ$ for all $\varepsilon\geq0$. The derivation relies on convex conjugation (the Legendre transform) and level set integration, and is sufficiently general to extend to tests between $σ$-finite measures. Measure change identities relating the $β(\cdot)$ functions of different hypothesis testing problems are established. Approximations for Type II and Type I volumes are derived under two different hypotheses concerning the Kolmogorov distance to normality for the log-likelihood ratio distributions. In both the Central Limit Theorem and the large deviations regimes, the resulting non-asymptotic expressions recover and extend state-of-the-art characterizations of optimal performance in the memoryless case, and improve and generalize them in the Markovian case. Finally, The distinction between the implications of the Central Limit Theorem and the Berry--Esseen Theorem for the asymptotic simple hypothesis testing problem is clarified.

cs.IT↗

The Mutual Information In The Vicinity of Capacity-Achieving Input Distributions

The mutual information is bounded from above by a decreasing affine function of the square of the distance between the input distribution and the set of all capacity-achieving input distributions $Π_{\mathcal{A}}$, on small enough neighborhoods of $Π_{\mathcal{A}}$, using an identity due to Topsøe and the Pinsker's inequality, assuming that the input set of the channel is finite and the constraint set $\mathcal{A}$ is polyhedral, i.e., can be described by (possibly multiple but) finitely many linear constraints. Counterexamples demonstrating nonexistence of such a quadratic bound are provided for the case of infinitely many linear constraints and the case of infinite input sets. Using Taylor's theorem with the remainder term, rather than the Pinsker's inequality and invoking Moreau's decomposition theorem the exact characterization of the slowest decrease of the mutual information with the distance to $Π_{\mathcal{A}}$ is determined on small neighborhoods of $Π_{\mathcal{A}}$. Corresponding results for classical-quantum channels are established under separable output Hilbert space assumption for the quadratic bound and under finite-dimensional output Hilbert space assumption for the exact characterization. Implications of these observations for the channel coding problem and applications of the proof techniques to related problems are discussed.

cs.IT↗

The Augustin Center and The Sphere Packing Bound For Memoryless Channels

For any channel with a convex constraint set and finite Augustin capacity, existence of a unique Augustin center and associated Erven-Harremoes bound are established. Augustin-Legendre capacity, center, and radius are introduced and proved to be equal to the corresponding Renyi-Gallager entities. Sphere packing bounds with polynomial prefactors are derived for codes on two families of channels: (possibly non-stationary) memoryless channels with multiple additive cost constraints and stationary memoryless channels with convex constraints on the empirical distribution of the input codewords.

cs.IT↗