Achievable error exponents for almost fixed-length binary classification
Author：白琳 Time：July 1, 2022 Number of clicks：
Language：English
Journal：IEEE International Symposium on Information Theory (ISIT 2022) (Pp. 1336-1341)
Date of Publication：July 1, 2022
Abstract：
We revisit the binary classification problem where the generating distribution under each hypothesis is unknown and propose a two-phase test, where each phase is a fixed-length test and the second-phase proceeds only if a reject option is decided in the first phase. We derive the achievable error exponents of both type-I and type-II error probabilities. Furthermore, we illustrate our results via numerical examples and show that the performance close to sequential test can be achieved with the much simpler and less complex almost fixed-length test. Our results generalize the design and analysis of the almost fixed-length test for binary hypothesis testing (Lalitha and Javidi, ISIT 2016) to the more practical setting of binary classification.
Original Link
