A Unified Study on Sequentiality in Universal Classification with Empirically Observed Statistics

• Published in: Proceedings / IEEE International Symposium on Information Theory pp. 1480 - 1485
• Main Authors: Li, Ching-Fang, Wang, I-Hsiang
• Format: Conference Proceeding
• Language: English
• Published: IEEE 07.07.2024
• Subjects: Information theory; Reliability; Testing
• DOI: 10.1109/ISIT57864.2024.10619272

In hypothesis testing problems, taking samples sequentially and stopping opportunistically to make the inference greatly enhances the reliability. The design of the stopping and inference policy, however, critically relies on the knowledge of the underlying distribution of each hypothesis. When the knowledge of distributions, say, P_{0} and P_{1} in the binary-hypothesis case, is replaced by empirically observed statistics from the respective distributions, the gain of sequentiality is less understood when subject to universality constraints. In this work, the gap is mended by a unified study on sequentiality in the universal binary classification problem. We propose a unified framework where the universality constraints are set on the expected stopping time as well as the type-I error exponent. The type-I error exponent is required to achieve a pre-set distribution-dependent constraint \lambda(P_{0}, P_{1}) for all P_{0}, P_{1} . The framework is employed to investigate a semi-sequential and a fully-sequential setup, so that fair comparison can be made with the fixed-length setup. The optimal type-II error exponents in different setups are characterized when the function \lambda satisfies mild continuity conditions. The benefit of sequentiality is shown by comparing the semi-sequential, the fully-sequential, and the fixed-length cases in representative examples of \lambda . Conditions under which sequentiality eradicates the trade-off between error exponents are also derived.