Title :
Generalized Error Exponents for Small Sample Universal Hypothesis Testing
Author :
Dayu Huang ; Meyn, Sean
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
Abstract :
The small sample universal hypothesis testing problem is investigated in this paper, in which the number of samples n is smaller than the number of possible outcomes m. The goal of this paper is to find an appropriate criterion to analyze statistical tests in this setting. A suitable model for analysis is the high-dimensional model in which both n and m increase to infinity, and n=o(m). A new performance criterion based on large deviations analysis is proposed and it generalizes the classical error exponent applicable for large sample problems (in which m=O(n)). This generalized error exponent criterion provides insights that are not available from asymptotic consistency or central limit theorem analysis. The following results are established for the uniform null distribution: 1) The best achievable probability of error Pe decays as Pe=exp{-(n2/m) J (1+o(1))} for some J > 0. 2) A class of tests based on separable statistics, including the coincidence-based test, attains the optimal generalized error exponents. 3) Pearson´s chi-square test has a zero generalized error exponent and thus its probability of error is asymptotically larger than the optimal test.
Keywords :
computational complexity; statistical distributions; statistical testing; Pearson chi-square test; central limit theorem analysis; coincidence-based test; deviations analysis; error probability; generalized error exponent criterion; performance criterion; small sample universal hypothesis testing; statistical test analysis; uniform null distribution; Analytical models; Approximation methods; Conferences; Current measurement; Probability; Testing; Upper bound; Bahadur efficiency; Chernoff efficiency; error exponent; hypothesis testing; large alphabet; large deviations; separable statistic; small sample;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2013.2283266